Base | Representation |
---|---|
bin | 1001010010111000100000… |
… | …0101000000101100001111 |
3 | 1100012000122002021000221212 |
4 | 2110232020011000230033 |
5 | 2314421040103241421 |
6 | 33423001411245035 |
7 | 2103241244320160 |
oct | 224561005005417 |
9 | 40160562230855 |
10 | 10220010212111 |
11 | 32903113697a7 |
12 | 11908588a977b |
13 | 591986cb959b |
14 | 2749189d3767 |
15 | 12aca4e9de5b |
hex | 94b88140b0f |
10220010212111 has 32 divisors (see below), whose sum is σ = 11854814400000. Its totient is φ = 8629959480192.
The previous prime is 10220010211993. The next prime is 10220010212207. The reversal of 10220010212111 is 11121201002201.
It is a cyclic number.
It is not a de Polignac number, because 10220010212111 - 218 = 10220009949967 is a prime.
It is a super-2 number, since 2×102200102121112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220010212911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 102368360 + ... + 102468146.
It is an arithmetic number, because the mean of its divisors is an integer number (370462950000).
Almost surely, 210220010212111 is an apocalyptic number.
10220010212111 is a deficient number, since it is larger than the sum of its proper divisors (1634804187889).
10220010212111 is a wasteful number, since it uses less digits than its factorization.
10220010212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100671.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10220010212111 its reverse (11121201002201), we get a palindrome (21341211214312).
The spelling of 10220010212111 in words is "ten trillion, two hundred twenty billion, ten million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •