Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …1000000010010101110011 |
3 | 1022202122110202202200201011 |
4 | 2102333103020002111303 |
5 | 2310443332103242321 |
6 | 33252201240251351 |
7 | 2061526310106022 |
oct | 222772310022563 |
9 | 38678422680634 |
10 | 10101010212211 |
11 | 32448a5a28546 |
12 | 1171787a70b57 |
13 | 5836a103c469 |
14 | 26cc6a3d88b9 |
15 | 127b3cbc9ae1 |
hex | 92fd3202573 |
10101010212211 has 16 divisors (see below), whose sum is σ = 10313459896320. Its totient is φ = 9890770178880.
The previous prime is 10101010212149. The next prime is 10101010212233. The reversal of 10101010212211 is 11221201010101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10101010212211 - 211 = 10101010210163 is a prime.
It is a super-2 number, since 2×101010102122112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101010212191 and 10101010212200.
It is not an unprimeable number, because it can be changed into a prime (10101010212281) 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, 6293200 + ... + 7733458.
It is an arithmetic number, because the mean of its divisors is an integer number (644591243520).
Almost surely, 210101010212211 is an apocalyptic number.
10101010212211 is a deficient number, since it is larger than the sum of its proper divisors (212449684109).
10101010212211 is a wasteful number, since it uses less digits than its factorization.
10101010212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1441026.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10101010212211 its reverse (11221201010101), we get a palindrome (21322211222312).
The spelling of 10101010212211 in words is "ten trillion, one hundred one billion, ten million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •