Base | Representation |
---|---|
bin | 10110110000101010100001… |
… | …110010001110111111000011 |
3 | 111010102120202021120000211212 |
4 | 112300222201302032333003 |
5 | 101110024300324212211 |
6 | 552521511103400335 |
7 | 30041034412615232 |
oct | 2660524162167703 |
9 | 433376667500755 |
10 | 100101222100931 |
11 | 29993765273847 |
12 | b2883548b30ab |
13 | 43b1673bb761c |
14 | 1aa0cd42b6b19 |
15 | b88ce0e5d38b |
hex | 5b0aa1c8efc3 |
100101222100931 has 2 divisors, whose sum is σ = 100101222100932. Its totient is φ = 100101222100930.
The previous prime is 100101222100907. The next prime is 100101222100951. The reversal of 100101222100931 is 139001222101001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100101222100931 is a prime.
It is a super-2 number, since 2×1001012221009312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100101222100897 and 100101222100906.
It is not a weakly prime, because it can be changed into another prime (100101222100951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050611050465 + 50050611050466.
It is an arithmetic number, because the mean of its divisors is an integer number (50050611050466).
Almost surely, 2100101222100931 is an apocalyptic number.
100101222100931 is a deficient number, since it is larger than the sum of its proper divisors (1).
100101222100931 is an equidigital number, since it uses as much as digits as its factorization.
100101222100931 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 100101222100931 its reverse (139001222101001), we get a palindrome (239102444201932).
The spelling of 100101222100931 in words is "one hundred trillion, one hundred one billion, two hundred twenty-two million, one hundred thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •