Base | Representation |
---|---|
bin | 10011010000100010101… |
… | …000101111100100110101 |
3 | 11200112000011222021010102 |
4 | 103100202220233210311 |
5 | 133140341321030031 |
6 | 2451550440003445 |
7 | 164420566113350 |
oct | 23204250574465 |
9 | 4615004867112 |
10 | 1323431033141 |
11 | 47029a353198 |
12 | 1945a6460585 |
13 | 97a505721a9 |
14 | 480a93d9297 |
15 | 2465aec87cb |
hex | 13422a2f935 |
1323431033141 has 8 divisors (see below), whose sum is σ = 1547666856384. Its totient is φ = 1107988771680.
The previous prime is 1323431033011. The next prime is 1323431033147. The reversal of 1323431033141 is 1413301343231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1323431033141 - 214 = 1323431016757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323431033147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2198390120 + ... + 2198390721.
It is an arithmetic number, because the mean of its divisors is an integer number (193458357048).
Almost surely, 21323431033141 is an apocalyptic number.
It is an amenable number.
1323431033141 is a deficient number, since it is larger than the sum of its proper divisors (224235823243).
1323431033141 is an equidigital number, since it uses as much as digits as its factorization.
1323431033141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4396780891.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 1323431033141 its reverse (1413301343231), we get a palindrome (2736732376372).
The spelling of 1323431033141 in words is "one trillion, three hundred twenty-three billion, four hundred thirty-one million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •