Base | Representation |
---|---|
bin | 1001010010111001010000… |
… | …0111001100001100100000 |
3 | 1100012001011011011111221121 |
4 | 2110232110013030030200 |
5 | 2314421443300010422 |
6 | 33423033422502024 |
7 | 2103246245401114 |
oct | 224562407141440 |
9 | 40161134144847 |
10 | 10220212110112 |
11 | 3290405328754 |
12 | 11908b4434914 |
13 | 5919b9a89764 |
14 | 27493774b744 |
15 | 12acb7a808c7 |
hex | 94b941cc320 |
10220212110112 has 48 divisors (see below), whose sum is σ = 20565083794752. Its totient is φ = 4998552851200.
The previous prime is 10220212110079. The next prime is 10220212110253. The reversal of 10220212110112 is 21101121202201.
It is a super-2 number, since 2×102202121101122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 18781108 + ... + 19317619.
It is an arithmetic number, because the mean of its divisors is an integer number (428439245724).
Almost surely, 210220212110112 is an apocalyptic number.
It is an amenable number.
10220212110112 is an abundant number, since it is smaller than the sum of its proper divisors (10344871684640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220212110112 is a wasteful number, since it uses less digits than its factorization.
10220212110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38098921 (or 38098913 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10220212110112 its reverse (21101121202201), we get a palindrome (31321333312313).
The spelling of 10220212110112 in words is "ten trillion, two hundred twenty billion, two hundred twelve million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •