Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …110111010000000011010011 |
3 | 111021022211002002101220211120 |
4 | 113000223231313100003103 |
5 | 101231043204042042321 |
6 | 555123321151013323 |
7 | 30213414103414611 |
oct | 2700535567200323 |
9 | 437284062356746 |
10 | 101202010112211 |
11 | 2a278593417328 |
12 | b42576450a243 |
13 | 4461402008958 |
14 | 1adc2bc2a86b1 |
15 | ba776abb8ec6 |
hex | 5c0aeddd00d3 |
101202010112211 has 16 divisors (see below), whose sum is σ = 135115907359488. Its totient is φ = 67378061973600.
The previous prime is 101202010112197. The next prime is 101202010112219. The reversal of 101202010112211 is 112211010202101.
It is a happy number.
It is not a de Polignac number, because 101202010112211 - 25 = 101202010112179 is a prime.
It is a super-2 number, since 2×1012020101122112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101202010112219) 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 in 15 ways as a sum of consecutive naturals, for example, 229402716 + ... + 229843446.
It is an arithmetic number, because the mean of its divisors is an integer number (8444744209968).
Almost surely, 2101202010112211 is an apocalyptic number.
101202010112211 is a deficient number, since it is larger than the sum of its proper divisors (33913897247277).
101202010112211 is a wasteful number, since it uses less digits than its factorization.
101202010112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542602.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101202010112211 its reverse (112211010202101), we get a palindrome (213413020314312).
The spelling of 101202010112211 in words is "one hundred one trillion, two hundred two billion, ten million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •