Base | Representation |
---|---|
bin | 1011000000010100000001… |
… | …0001011111101101101001 |
3 | 1120211202012212222110111200 |
4 | 2300011000101133231221 |
5 | 3041221300301413001 |
6 | 41422355214514413 |
7 | 2356124211132330 |
oct | 260050021375551 |
9 | 46752185873450 |
10 | 12100001201001 |
11 | 394564426026a |
12 | 1435089b05a09 |
13 | 69a04352cb7c |
14 | 2db900c72d17 |
15 | 15eb372e6086 |
hex | b014045fb69 |
12100001201001 has 12 divisors (see below), whose sum is σ = 19974605157312. Its totient is φ = 6914286400536.
The previous prime is 12100001200999. The next prime is 12100001201051. The reversal of 12100001201001 is 10010210000121.
It is a happy number.
It is not a de Polignac number, because 12100001201001 - 21 = 12100001200999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (12100001201051) 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 11 ways as a sum of consecutive naturals, for example, 96031755501 + ... + 96031755626.
It is an arithmetic number, because the mean of its divisors is an integer number (1664550429776).
Almost surely, 212100001201001 is an apocalyptic number.
It is an amenable number.
12100001201001 is a deficient number, since it is larger than the sum of its proper divisors (7874603956311).
12100001201001 is a wasteful number, since it uses less digits than its factorization.
12100001201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192063511140 (or 192063511137 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12100001201001 its reverse (10010210000121), we get a palindrome (22110211201122).
The spelling of 12100001201001 in words is "twelve trillion, one hundred billion, one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •