Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0011100000000001011 |
3 | 100122222200110000111202 |
4 | 1132022300130000023 |
5 | 3124034210414402 |
6 | 114241133214415 |
7 | 10206440346452 |
oct | 1361260340013 |
9 | 318880400452 |
10 | 101112201227 |
11 | 39977224374 |
12 | 1771a33140b |
13 | 96c5072b8b |
14 | 4c72a57b99 |
15 | 296bbd0b02 |
hex | 178ac1c00b |
101112201227 has 2 divisors, whose sum is σ = 101112201228. Its totient is φ = 101112201226.
The previous prime is 101112201187. The next prime is 101112201247. The reversal of 101112201227 is 722102211101.
It is a happy number.
It is an a-pointer prime, because the next prime (101112201247) can be obtained adding 101112201227 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101112201227 - 218 = 101111939083 is a prime.
It is a super-4 number, since 4×1011122012274 (a number of 45 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101112201199 and 101112201208.
It is not a weakly prime, because it can be changed into another prime (101112201247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556100613 + 50556100614.
It is an arithmetic number, because the mean of its divisors is an integer number (50556100614).
Almost surely, 2101112201227 is an apocalyptic number.
101112201227 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112201227 is an equidigital number, since it uses as much as digits as its factorization.
101112201227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 101112201227 its reverse (722102211101), we get a palindrome (823214412328).
The spelling of 101112201227 in words is "one hundred one billion, one hundred twelve million, two hundred one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •