Base | Representation |
---|---|
bin | 1001000110000101010110… |
… | …0111001100001100010001 |
3 | 1022102000001120102010222100 |
4 | 2101201111213030030101 |
5 | 2302320221232431001 |
6 | 33133554121231013 |
7 | 2051325205136406 |
oct | 221412547141421 |
9 | 38360046363870 |
10 | 10000120202001 |
11 | 3206033173616 |
12 | 1156110032469 |
13 | 577013023377 |
14 | 26801909c2ad |
15 | 1251d5788586 |
hex | 918559cc311 |
10000120202001 has 36 divisors (see below), whose sum is σ = 15059738258292. Its totient is φ = 6389749105344.
The previous prime is 10000120201999. The next prime is 10000120202003. The reversal of 10000120202001 is 10020202100001.
It is an interprime number because it is at equal distance from previous prime (10000120201999) and next prime (10000120202003).
It can be written as a sum of positive squares in 2 ways, for example, as 6415080905601 + 3585039296400 = 2532801^2 + 1893420^2 .
It is not a de Polignac number, because 10000120202001 - 21 = 10000120201999 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 (10000120202003) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1850050 + ... + 4839723.
Almost surely, 210000120202001 is an apocalyptic number.
It is an amenable number.
10000120202001 is a deficient number, since it is larger than the sum of its proper divisors (5059618056291).
10000120202001 is an equidigital number, since it uses as much as digits as its factorization.
10000120202001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6689950 (or 6689880 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10000120202001 its reverse (10020202100001), we get a palindrome (20020322302002).
The spelling of 10000120202001 in words is "ten trillion, one hundred twenty million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.540 sec. • engine limits •