Base | Representation |
---|---|
bin | 10110010110111001… |
… | …00100111111110011 |
3 | 1010222112010210022102 |
4 | 23023130210333303 |
5 | 144040304413021 |
6 | 5303022131015 |
7 | 603310345064 |
oct | 131334447763 |
9 | 33875123272 |
10 | 12003201011 |
11 | 50aa54863a |
12 | 23aba20a6b |
13 | 1193a15809 |
14 | 81c21256b |
15 | 4a3ba400b |
hex | 2cb724ff3 |
12003201011 has 2 divisors, whose sum is σ = 12003201012. Its totient is φ = 12003201010.
The previous prime is 12003200977. The next prime is 12003201013. The reversal of 12003201011 is 11010230021.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12003201011 is a prime.
It is a Sophie Germain prime.
Together with 12003201013, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12003200983 and 12003201001.
It is not a weakly prime, because it can be changed into another prime (12003201013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001600505 + 6001600506.
It is an arithmetic number, because the mean of its divisors is an integer number (6001600506).
Almost surely, 212003201011 is an apocalyptic number.
12003201011 is a deficient number, since it is larger than the sum of its proper divisors (1).
12003201011 is an equidigital number, since it uses as much as digits as its factorization.
12003201011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 12003201011 its reverse (11010230021), we get a palindrome (23013431032).
The spelling of 12003201011 in words is "twelve billion, three million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •