Base | Representation |
---|---|
bin | 1001000110001100110001… |
… | …0010010010001010010011 |
3 | 1022102012012022211211200012 |
4 | 2101203030102102022103 |
5 | 2302333310432211011 |
6 | 33134523443345135 |
7 | 2051425432341005 |
oct | 221431422221223 |
9 | 38365168754605 |
10 | 10002111210131 |
11 | 3206965029487 |
12 | 11565869821ab |
13 | 57726c66c9a1 |
14 | 268167696375 |
15 | 1252a0471a8b |
hex | 918cc492293 |
10002111210131 has 2 divisors, whose sum is σ = 10002111210132. Its totient is φ = 10002111210130.
The previous prime is 10002111210109. The next prime is 10002111210187. The reversal of 10002111210131 is 13101211120001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002111210131 is a prime.
It is a super-2 number, since 2×100021112101312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10002111210191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001055605065 + 5001055605066.
It is an arithmetic number, because the mean of its divisors is an integer number (5001055605066).
Almost surely, 210002111210131 is an apocalyptic number.
10002111210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002111210131 is an equidigital number, since it uses as much as digits as its factorization.
10002111210131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 10002111210131 its reverse (13101211120001), we get a palindrome (23103322330132).
The spelling of 10002111210131 in words is "ten trillion, two billion, one hundred eleven million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •