Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0001010111111001001011 |
3 | 1022202112220002002212211111 |
4 | 2102332113201113321023 |
5 | 2310434310104034011 |
6 | 33251514115111151 |
7 | 2061462445243105 |
oct | 222762741277113 |
9 | 38675802085744 |
10 | 10100010221131 |
11 | 3244432510436 |
12 | 1171548ba24b7 |
13 | 583571b0636c |
14 | 26cbb3690575 |
15 | 127aceeeb121 |
hex | 92f97857e4b |
10100010221131 has 2 divisors, whose sum is σ = 10100010221132. Its totient is φ = 10100010221130.
The previous prime is 10100010221101. The next prime is 10100010221237. The reversal of 10100010221131 is 13112201000101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10100010221131 - 215 = 10100010188363 is a prime.
It is a super-2 number, since 2×101000102211312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10100010221101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050005110565 + 5050005110566.
It is an arithmetic number, because the mean of its divisors is an integer number (5050005110566).
Almost surely, 210100010221131 is an apocalyptic number.
10100010221131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100010221131 is an equidigital number, since it uses as much as digits as its factorization.
10100010221131 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 13.
Adding to 10100010221131 its reverse (13112201000101), we get a palindrome (23212211221232).
The spelling of 10100010221131 in words is "ten trillion, one hundred billion, ten million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •