Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …010001100111000100101010 |
3 | 112200120002120122022001022000 |
4 | 121131310020101213010222 |
5 | 104140002000224341020 |
6 | 1034112031250311430 |
7 | 32406506301601236 |
oct | 3135641021470452 |
9 | 480502518261260 |
10 | 112000001012010 |
11 | 32760a2a812351 |
12 | 1068a425888576 |
13 | 4a65729acb347 |
14 | 1d92b869b55c6 |
15 | ce359c840090 |
hex | 65dd0846712a |
112000001012010 has 64 divisors (see below), whose sum is σ = 298676741126400. Its totient is φ = 29865659760576.
The previous prime is 112000001011991. The next prime is 112000001012083. The reversal of 112000001012010 is 10210100000211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 112000001011983 and 112000001012001.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1044171 + ... + 15003009.
It is an arithmetic number, because the mean of its divisors is an integer number (4666824080100).
Almost surely, 2112000001012010 is an apocalyptic number.
112000001012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112000001012010 is an abundant number, since it is smaller than the sum of its proper divisors (186676740114390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000001012010 is a wasteful number, since it uses less digits than its factorization.
112000001012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13988572 (or 13988566 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112000001012010 its reverse (10210100000211), we get a palindrome (122210101012221).
The spelling of 112000001012010 in words is "one hundred twelve trillion, one million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •