Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0010000110010101110000 |
3 | 1100012000220001020110222220 |
4 | 2110232032002012111300 |
5 | 2314421241142041422 |
6 | 33423015340401040 |
7 | 2103243566414625 |
oct | 224561602062560 |
9 | 40160801213886 |
10 | 10220110112112 |
11 | 32903627a208a |
12 | 1190886246180 |
13 | 5919a18c6704 |
14 | 274927d9a34c |
15 | 12acadb33e5c |
hex | 94b8e086570 |
10220110112112 has 80 divisors (see below), whose sum is σ = 26549682711552. Its totient is φ = 3387643879680.
The previous prime is 10220110112111. The next prime is 10220110112167. The reversal of 10220110112112 is 21121101102201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10220110112091 and 10220110112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220110112111) 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, 158845293 + ... + 158909619.
Almost surely, 210220110112112 is an apocalyptic number.
10220110112112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10220110112112 is an abundant number, since it is smaller than the sum of its proper divisors (16329572599440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220110112112 is a wasteful number, since it uses less digits than its factorization.
10220110112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82806 (or 82800 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10220110112112 its reverse (21121101102201), we get a palindrome (31341211214313).
The spelling of 10220110112112 in words is "ten trillion, two hundred twenty billion, one hundred ten million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •