Base | Representation |
---|---|
bin | 1010111010100111010011… |
… | …1110101000100001110010 |
3 | 1120111101112001212011201002 |
4 | 2232221310332220201302 |
5 | 3033120300401413020 |
6 | 41305404510042002 |
7 | 2346060153640664 |
oct | 256516476504162 |
9 | 46441461764632 |
10 | 12002101201010 |
11 | 3908076263268 |
12 | 141a1074a9302 |
13 | 690a40b0b2ab |
14 | 2d6c94a9c534 |
15 | 15c307623975 |
hex | aea74fa8872 |
12002101201010 has 16 divisors (see below), whose sum is σ = 21603992419800. Its totient is φ = 4800793756416.
The previous prime is 12002101200979. The next prime is 12002101201031. The reversal of 12002101201010 is 1010210120021.
It can be written as a sum of positive squares in 4 ways, for example, as 7299782679721 + 4702318521289 = 2701811^2 + 2168483^2 .
It is a super-3 number, since 3×120021012010103 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12002101200982 and 12002101201000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4751975 + ... + 6825354.
Almost surely, 212002101201010 is an apocalyptic number.
12002101201010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12002101201010 is a deficient number, since it is larger than the sum of its proper divisors (9601891218790).
12002101201010 is a wasteful number, since it uses less digits than its factorization.
12002101201010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11681005.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 12002101201010 its reverse (1010210120021), we get a palindrome (13012311321031).
The spelling of 12002101201010 in words is "twelve trillion, two billion, one hundred one million, two hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •