Base | Representation |
---|---|
bin | 1001000110001100110001… |
… | …0001110111010001101101 |
3 | 1022102012012022122020121202 |
4 | 2101203030101313101231 |
5 | 2302333310420200023 |
6 | 33134523441135245 |
7 | 2051425431401654 |
oct | 221431421672155 |
9 | 38365168566552 |
10 | 10002111100013 |
11 | 3206964a6377a |
12 | 115658692a525 |
13 | 57726c631826 |
14 | 26816766819b |
15 | 1252a044e128 |
hex | 918cc47746d |
10002111100013 has 2 divisors, whose sum is σ = 10002111100014. Its totient is φ = 10002111100012.
The previous prime is 10002111100001. The next prime is 10002111100061. The reversal of 10002111100013 is 31000111120001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7458459316324 + 2543651783689 = 2731018^2 + 1594883^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002111100013 - 24 = 10002111099997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002111099967 and 10002111100003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002111100213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001055550006 + 5001055550007.
It is an arithmetic number, because the mean of its divisors is an integer number (5001055550007).
Almost surely, 210002111100013 is an apocalyptic number.
It is an amenable number.
10002111100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002111100013 is an equidigital number, since it uses as much as digits as its factorization.
10002111100013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10002111100013 its reverse (31000111120001), we get a palindrome (41002222220014).
The spelling of 10002111100013 in words is "ten trillion, two billion, one hundred eleven million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •