Base | Representation |
---|---|
bin | 1010111100010111111011… |
… | …0001001000000011000011 |
3 | 1120121021112210001121012122 |
4 | 2233011332301020003003 |
5 | 3034114203013001311 |
6 | 41331324242314455 |
7 | 2351210234136044 |
oct | 257057661100303 |
9 | 46537483047178 |
10 | 12032330203331 |
11 | 3919978799109 |
12 | 1423b43058a2b |
13 | 69384a773509 |
14 | 2d85216b88cb |
15 | 15cec63d50db |
hex | af17ec480c3 |
12032330203331 has 2 divisors, whose sum is σ = 12032330203332. Its totient is φ = 12032330203330.
The previous prime is 12032330203279. The next prime is 12032330203339. The reversal of 12032330203331 is 13330203323021.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12032330203331 - 230 = 12031256461507 is a prime.
It is a super-2 number, since 2×120323302033312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12032330203331.
It is not a weakly prime, because it can be changed into another prime (12032330203339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6016165101665 + 6016165101666.
It is an arithmetic number, because the mean of its divisors is an integer number (6016165101666).
Almost surely, 212032330203331 is an apocalyptic number.
12032330203331 is a deficient number, since it is larger than the sum of its proper divisors (1).
12032330203331 is an equidigital number, since it uses as much as digits as its factorization.
12032330203331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 12032330203331 its reverse (13330203323021), we get a palindrome (25362533526352).
The spelling of 12032330203331 in words is "twelve trillion, thirty-two billion, three hundred thirty million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •