Base | Representation |
---|---|
bin | 1001010001110101011010… |
… | …1001011001010011001111 |
3 | 1100010022010222210021212202 |
4 | 2110131112221121103033 |
5 | 2314122144230120421 |
6 | 33410422355552115 |
7 | 2102033044602215 |
oct | 224352651312317 |
9 | 40108128707782 |
10 | 10202001020111 |
11 | 328370a67924a |
12 | 11892715bb63b |
13 | 590076bbb164 |
14 | 273acac92cb5 |
15 | 12a59ddcc10b |
hex | 94756a594cf |
10202001020111 has 16 divisors (see below), whose sum is σ = 10473883580160. Its totient is φ = 9931698913920.
The previous prime is 10202001020083. The next prime is 10202001020129. The reversal of 10202001020111 is 11102010020201.
It is a cyclic number.
It is not a de Polignac number, because 10202001020111 - 242 = 5803954509007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10202001020092 and 10202001020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202001020311) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 155535320 + ... + 155600898.
It is an arithmetic number, because the mean of its divisors is an integer number (654617723760).
Almost surely, 210202001020111 is an apocalyptic number.
10202001020111 is a deficient number, since it is larger than the sum of its proper divisors (271882560049).
10202001020111 is a wasteful number, since it uses less digits than its factorization.
10202001020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77566.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10202001020111 its reverse (11102010020201), we get a palindrome (21304011040312).
The spelling of 10202001020111 in words is "ten trillion, two hundred two billion, one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •