Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0011100100101110010001 |
3 | 1022101222202220102120100021 |
4 | 2101201033003210232101 |
5 | 2302320010102431001 |
6 | 33133535151423441 |
7 | 2051322401144611 |
oct | 221411703445621 |
9 | 38358686376307 |
10 | 10000010202001 |
11 | 3205a87071a26 |
12 | 115609b224b81 |
13 | 576cc62bb001 |
14 | 268008626a41 |
15 | 1251cacaaba1 |
hex | 9184f0e4b91 |
10000010202001 has 16 divisors (see below), whose sum is σ = 10177227244800. Its totient is φ = 9823053755008.
The previous prime is 10000010201983. The next prime is 10000010202019. The reversal of 10000010202001 is 10020201000001.
It is an interprime number because it is at equal distance from previous prime (10000010201983) and next prime (10000010202019).
It is a cyclic number.
It is not a de Polignac number, because 10000010202001 - 231 = 9997862718353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10000010202031) 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 15 ways as a sum of consecutive naturals, for example, 481013715 + ... + 481034503.
It is an arithmetic number, because the mean of its divisors is an integer number (636076702800).
Almost surely, 210000010202001 is an apocalyptic number.
It is an amenable number.
10000010202001 is a deficient number, since it is larger than the sum of its proper divisors (177217042799).
10000010202001 is a wasteful number, since it uses less digits than its factorization.
10000010202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26648.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 10000010202001 its reverse (10020201000001), we get a palindrome (20020211202002).
The spelling of 10000010202001 in words is "ten trillion, ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •