Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1111100100101100101101 |
3 | 1022102012011200201120001010 |
4 | 2101203023233210230231 |
5 | 2302333301120023041 |
6 | 33134522520335433 |
7 | 2051425262112666 |
oct | 221431357445455 |
9 | 38365150646033 |
10 | 10002102111021 |
11 | 320695a984159 |
12 | 1156583914579 |
13 | 57726a8051b7 |
14 | 2681663a836d |
15 | 12529e775a16 |
hex | 918cbbe4b2d |
10002102111021 has 16 divisors (see below), whose sum is σ = 13923601883136. Its totient is φ = 6374653278576.
The previous prime is 10002102111007. The next prime is 10002102111031. The reversal of 10002102111021 is 12011120120001.
It is not a de Polignac number, because 10002102111021 - 215 = 10002102078253 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10002102110988 and 10002102111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002102111031) 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, 39632305 + ... + 39883878.
It is an arithmetic number, because the mean of its divisors is an integer number (870225117696).
Almost surely, 210002102111021 is an apocalyptic number.
It is an amenable number.
10002102111021 is a deficient number, since it is larger than the sum of its proper divisors (3921499772115).
10002102111021 is a wasteful number, since it uses less digits than its factorization.
10002102111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79518032.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10002102111021 its reverse (12011120120001), we get a palindrome (22013222231022).
The spelling of 10002102111021 in words is "ten trillion, two billion, one hundred two million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •