Base | Representation |
---|---|
bin | 110100010000011010… |
… | …1011001110100101010 |
3 | 101201122210202200022102 |
4 | 1220200311121310222 |
5 | 3314311311120020 |
6 | 123315252253402 |
7 | 11051626301000 |
oct | 1504065316452 |
9 | 351583680272 |
10 | 112220020010 |
11 | 43657303a9a |
12 | 198ba311262 |
13 | a77541ab07 |
14 | 5607d92a70 |
15 | 2dbbe6b475 |
hex | 1a20d59d2a |
112220020010 has 64 divisors (see below), whose sum is σ = 235751731200. Its totient is φ = 38444757120.
The previous prime is 112220020009. The next prime is 112220020013. The reversal of 112220020010 is 10020022211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 112220019973 and 112220020000.
It is not an unprimeable number, because it can be changed into a prime (112220020013) 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, 4518647 + ... + 4543413.
It is an arithmetic number, because the mean of its divisors is an integer number (3683620800).
Almost surely, 2112220020010 is an apocalyptic number.
112220020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112220020010 is an abundant number, since it is smaller than the sum of its proper divisors (123531711190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112220020010 is a wasteful number, since it uses less digits than its factorization.
112220020010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26116 (or 26102 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 112220020010 its reverse (10020022211), we get a palindrome (122240042221).
The spelling of 112220020010 in words is "one hundred twelve billion, two hundred twenty million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •