Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …011000100110011101110011 |
3 | 111020121201100010120220222222 |
4 | 112331301220120212131303 |
5 | 101214310002231242321 |
6 | 554451434322151255 |
7 | 30163111504323116 |
oct | 2675615030463563 |
9 | 436551303526888 |
10 | 101002202212211 |
11 | 2a200880032763 |
12 | b3b2aa11b252b |
13 | 444860b739021 |
14 | 1ad276591057d |
15 | ba247453d3ab |
hex | 5bdc68626773 |
101002202212211 has 16 divisors (see below), whose sum is σ = 108522104832000. Its totient is φ = 93659485637760.
The previous prime is 101002202212201. The next prime is 101002202212217. The reversal of 101002202212211 is 112212202200101.
It is a cyclic number.
It is not a de Polignac number, because 101002202212211 - 26 = 101002202212147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101002202212211.
It is not an unprimeable number, because it can be changed into a prime (101002202212217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26102771 + ... + 29721356.
It is an arithmetic number, because the mean of its divisors is an integer number (6782631552000).
Almost surely, 2101002202212211 is an apocalyptic number.
101002202212211 is a deficient number, since it is larger than the sum of its proper divisors (7519902619789).
101002202212211 is a wasteful number, since it uses less digits than its factorization.
101002202212211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55825714.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101002202212211 its reverse (112212202200101), we get a palindrome (213214404412312).
The spelling of 101002202212211 in words is "one hundred one trillion, two billion, two hundred two million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •