Base | Representation |
---|---|
bin | 1001000111010011111010… |
… | …1010011110000101000011 |
3 | 1022111000111100122000111120 |
4 | 2101310332222132011003 |
5 | 2303141414231202321 |
6 | 33151402541243323 |
7 | 2053002632510613 |
oct | 221647652360503 |
9 | 38430440560446 |
10 | 10021210022211 |
11 | 3213a758946a3 |
12 | 115a216b63543 |
13 | 578cc442631b |
14 | 269059dd2a43 |
15 | 125a1c028ec6 |
hex | 91d3ea9e143 |
10021210022211 has 16 divisors (see below), whose sum is σ = 14154428656800. Its totient is φ = 6284778925568.
The previous prime is 10021210022167. The next prime is 10021210022249. The reversal of 10021210022211 is 11222001212001.
10021210022211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10021210022211 - 29 = 10021210021699 is a prime.
It is a super-2 number, since 2×100212100222112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10021210023211) 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, 47379816 + ... + 47590853.
It is an arithmetic number, because the mean of its divisors is an integer number (884651791050).
Almost surely, 210021210022211 is an apocalyptic number.
10021210022211 is a deficient number, since it is larger than the sum of its proper divisors (4133218634589).
10021210022211 is a wasteful number, since it uses less digits than its factorization.
10021210022211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94972758.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10021210022211 its reverse (11222001212001), we get a palindrome (21243211234212).
The spelling of 10021210022211 in words is "ten trillion, twenty-one billion, two hundred ten million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •