Base | Representation |
---|---|
bin | 1011001000000100101011… |
… | …0001011001101000001111 |
3 | 1121022111100012022101022210 |
4 | 2302001022301121220033 |
5 | 3100412320224314043 |
6 | 42003524335441503 |
7 | 2401554051356613 |
oct | 262011261315017 |
9 | 47274305271283 |
10 | 12233321323023 |
11 | 3997138a68199 |
12 | 1456a96686293 |
13 | 6a979c210838 |
14 | 30414b275343 |
15 | 16333b884633 |
hex | b204ac59a0f |
12233321323023 has 8 divisors (see below), whose sum is σ = 16534534756528. Its totient is φ = 8043827719104.
The previous prime is 12233321322953. The next prime is 12233321323079. The reversal of 12233321323023 is 32032312333221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12233321323023 - 212 = 12233321318927 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12233321323823) 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, 27929957140 + ... + 27929957577.
It is an arithmetic number, because the mean of its divisors is an integer number (2066816844566).
Almost surely, 212233321323023 is an apocalyptic number.
12233321323023 is a deficient number, since it is larger than the sum of its proper divisors (4301213433505).
12233321323023 is an equidigital number, since it uses as much as digits as its factorization.
12233321323023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55859914793.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 12233321323023 its reverse (32032312333221), we get a palindrome (44265633656244).
The spelling of 12233321323023 in words is "twelve trillion, two hundred thirty-three billion, three hundred twenty-one million, three hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •