Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000110100011001000001111 |
3 | 111010002000022200001012001002 |
4 | 112233031102012203020033 |
5 | 101101404223324014411 |
6 | 552403512133010515 |
7 | 30030561335405333 |
oct | 2657152206431017 |
9 | 433060280035032 |
10 | 100001101001231 |
11 | 29955257545751 |
12 | b270a72483a3b |
13 | 43a50a9287571 |
14 | 1a9a1171317c3 |
15 | b863d12a233b |
hex | 5af3521a320f |
100001101001231 has 2 divisors, whose sum is σ = 100001101001232. Its totient is φ = 100001101001230.
The previous prime is 100001101001101. The next prime is 100001101001237. The reversal of 100001101001231 is 132100101100001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100001101001231 - 234 = 99983921132047 is a prime.
It is a super-2 number, since 2×1000011010012312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100001101001237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000550500615 + 50000550500616.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550500616).
Almost surely, 2100001101001231 is an apocalyptic number.
100001101001231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001101001231 is an equidigital number, since it uses as much as digits as its factorization.
100001101001231 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 100001101001231 its reverse (132100101100001), we get a palindrome (232101202101232).
The spelling of 100001101001231 in words is "one hundred trillion, one billion, one hundred one million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •