Base | Representation |
---|---|
bin | 10110110000110100100110… |
… | …000011010111101010000001 |
3 | 111010110121122120122002111111 |
4 | 112300310212003113222001 |
5 | 101110213414431320001 |
6 | 552530455430243321 |
7 | 30041566313016325 |
oct | 2660644603275201 |
9 | 433417576562444 |
10 | 100112031120001 |
11 | 2999830171985a |
12 | b28a4707b6541 |
13 | 43b26a7394bb4 |
14 | 1aa163ba71985 |
15 | b89224d75851 |
hex | 5b0d260d7a81 |
100112031120001 has 2 divisors, whose sum is σ = 100112031120002. Its totient is φ = 100112031120000.
The previous prime is 100112031119999. The next prime is 100112031120029. The reversal of 100112031120001 is 100021130211001.
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., 71839202591601 + 28272828528400 = 8475801^2 + 5317220^2 .
It is a cyclic number.
It is not a de Polignac number, because 100112031120001 - 21 = 100112031119999 is a prime.
Together with 100112031119999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100112031120091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50056015560000 + 50056015560001.
It is an arithmetic number, because the mean of its divisors is an integer number (50056015560001).
Almost surely, 2100112031120001 is an apocalyptic number.
It is an amenable number.
100112031120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112031120001 is an equidigital number, since it uses as much as digits as its factorization.
100112031120001 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 100112031120001 its reverse (100021130211001), we get a palindrome (200133161331002).
The spelling of 100112031120001 in words is "one hundred trillion, one hundred twelve billion, thirty-one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •