Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …110100010110101101000001 |
3 | 112200120002121021102210010000 |
4 | 121131310020310112231001 |
5 | 104140002010042320001 |
6 | 1034112032213430213 |
7 | 32406506442164163 |
oct | 3135641064265501 |
9 | 480502537383100 |
10 | 112000010120001 |
11 | 32760a34973313 |
12 | 1068a42893b369 |
13 | 4a6572b969ba3 |
14 | 1d92b87ca6933 |
15 | ce359d53da86 |
hex | 65dd08d16b41 |
112000010120001 has 10 divisors (see below), whose sum is σ = 167308657092962. Its totient is φ = 74666673413280.
The previous prime is 112000010119999. The next prime is 112000010120027. The reversal of 112000010120001 is 100021010000211.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 100448501760000 + 11551508360001 = 10022400^2 + 3398751^2 .
It is not a de Polignac number, because 112000010120001 - 21 = 112000010119999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112000010120051) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 691358087080 + ... + 691358087241.
Almost surely, 2112000010120001 is an apocalyptic number.
It is an amenable number.
112000010120001 is a deficient number, since it is larger than the sum of its proper divisors (55308646972961).
112000010120001 is an equidigital number, since it uses as much as digits as its factorization.
112000010120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1382716174333 (or 1382716174324 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 112000010120001 its reverse (100021010000211), we get a palindrome (212021020120212).
The spelling of 112000010120001 in words is "one hundred twelve trillion, ten million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •