Base | Representation |
---|---|
bin | 10110010110111001… |
… | …00101000011001101 |
3 | 1010222112010210121111 |
4 | 23023130211003031 |
5 | 144040304414404 |
6 | 5303022132021 |
7 | 603310345525 |
oct | 131334450315 |
9 | 33875123544 |
10 | 12003201229 |
11 | 50aa548818 |
12 | 23aba21011 |
13 | 1193a15946 |
14 | 81c212685 |
15 | 4a3ba4104 |
hex | 2cb7250cd |
12003201229 has 2 divisors, whose sum is σ = 12003201230. Its totient is φ = 12003201228.
The previous prime is 12003201193. The next prime is 12003201247. The reversal of 12003201229 is 92210230021.
12003201229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9667412329 + 2335788900 = 98323^2 + 48330^2 .
It is a cyclic number.
It is not a de Polignac number, because 12003201229 - 221 = 12001104077 is a prime.
It is a super-2 number, since 2×120032012292 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12003201029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001600614 + 6001600615.
It is an arithmetic number, because the mean of its divisors is an integer number (6001600615).
Almost surely, 212003201229 is an apocalyptic number.
It is an amenable number.
12003201229 is a deficient number, since it is larger than the sum of its proper divisors (1).
12003201229 is an equidigital number, since it uses as much as digits as its factorization.
12003201229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 12003201229 in words is "twelve billion, three million, two hundred one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •