Base | Representation |
---|---|
bin | 10111000000101011110011… |
… | …001110001100000011011011 |
3 | 111021022211022100120021002202 |
4 | 113000223303032030003123 |
5 | 101231043400100324402 |
6 | 555123334121520415 |
7 | 30213416244510065 |
oct | 2700536316140333 |
9 | 437284270507082 |
10 | 101202100011227 |
11 | 2a27862a139836 |
12 | b42578a64310b |
13 | 4461417823937 |
14 | 1adc2ca1ca735 |
15 | ba7773a25b02 |
hex | 5c0af338c0db |
101202100011227 has 2 divisors, whose sum is σ = 101202100011228. Its totient is φ = 101202100011226.
The previous prime is 101202100011211. The next prime is 101202100011263. The reversal of 101202100011227 is 722110001202101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101202100011227 - 24 = 101202100011211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101202100011199 and 101202100011208.
It is not a weakly prime, because it can be changed into another prime (101202100041227) 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, 50601050005613 + 50601050005614.
It is an arithmetic number, because the mean of its divisors is an integer number (50601050005614).
Almost surely, 2101202100011227 is an apocalyptic number.
101202100011227 is a deficient number, since it is larger than the sum of its proper divisors (1).
101202100011227 is an equidigital number, since it uses as much as digits as its factorization.
101202100011227 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 101202100011227 its reverse (722110001202101), we get a palindrome (823312101213328).
The spelling of 101202100011227 in words is "one hundred one trillion, two hundred two billion, one hundred million, eleven thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •