Base | Representation |
---|---|
bin | 10110111110000010001110… |
… | …100001101100101001010011 |
3 | 111020200102100000122221122010 |
4 | 112332002032201230221103 |
5 | 101220103001113001321 |
6 | 554503542450114003 |
7 | 30164312214114606 |
oct | 2676021641545123 |
9 | 436612300587563 |
10 | 101020022000211 |
11 | 2a208394918186 |
12 | b3b6434b7b903 |
13 | 444a1bb520092 |
14 | 1ad357642a33d |
15 | ba2b68b9a676 |
hex | 5be08e86ca53 |
101020022000211 has 32 divisors (see below), whose sum is σ = 142616228359680. Its totient is φ = 63427008960000.
The previous prime is 101020022000189. The next prime is 101020022000237. The reversal of 101020022000211 is 112000220020101.
It is not a de Polignac number, because 101020022000211 - 210 = 101020021999187 is a prime.
It is a super-2 number, since 2×1010200220002112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101020022000411) 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 31 ways as a sum of consecutive naturals, for example, 99594411 + ... + 100603611.
It is an arithmetic number, because the mean of its divisors is an integer number (4456757136240).
Almost surely, 2101020022000211 is an apocalyptic number.
101020022000211 is a deficient number, since it is larger than the sum of its proper divisors (41596206359469).
101020022000211 is a wasteful number, since it uses less digits than its factorization.
101020022000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019547.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101020022000211 its reverse (112000220020101), we get a palindrome (213020242020312).
The spelling of 101020022000211 in words is "one hundred one trillion, twenty billion, twenty-two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •