Base | Representation |
---|---|
bin | 10110111110000010011010… |
… | …010101110001010100010011 |
3 | 111020200102211211121112220212 |
4 | 112332002122111301110103 |
5 | 101220103402332401321 |
6 | 554504014250154335 |
7 | 30164320141564304 |
oct | 2676023225612423 |
9 | 436612754545825 |
10 | 101020220200211 |
11 | 2a208486790834 |
12 | b3b648b4229ab |
13 | 444a2205c6ca0 |
14 | 1ad35948a07ab |
15 | ba2b7b29b55b |
hex | 5be09a571513 |
101020220200211 has 16 divisors (see below), whose sum is σ = 108852717120000. Its totient is φ = 93196545396768.
The previous prime is 101020220200187. The next prime is 101020220200213. The reversal of 101020220200211 is 112002022020101.
It is a cyclic number.
It is not a de Polignac number, because 101020220200211 - 210 = 101020220199187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101020220200213) 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, 413253020 + ... + 413497398.
It is an arithmetic number, because the mean of its divisors is an integer number (6803294820000).
Almost surely, 2101020220200211 is an apocalyptic number.
101020220200211 is a deficient number, since it is larger than the sum of its proper divisors (7832496919789).
101020220200211 is a wasteful number, since it uses less digits than its factorization.
101020220200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262298.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101020220200211 its reverse (112002022020101), we get a palindrome (213022242220312).
The spelling of 101020220200211 in words is "one hundred one trillion, twenty billion, two hundred twenty million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •