Base | Representation |
---|---|
bin | 10000001011101000010… |
… | …111011001011110001001 |
3 | 10221022021012012102222001 |
4 | 100023220113121132021 |
5 | 121204334000310441 |
6 | 2210502403231001 |
7 | 143224253062540 |
oct | 20135027313611 |
9 | 3838235172861 |
10 | 1112000010121 |
11 | 39966201a230 |
12 | 15b61a678461 |
13 | 80b26c44590 |
14 | 3bb6d0c9157 |
15 | 1ddd4224731 |
hex | 102e85d9789 |
1112000010121 has 32 divisors (see below), whose sum is σ = 1557949575168. Its totient is φ = 765064491840.
The previous prime is 1112000010119. The next prime is 1112000010169. The reversal of 1112000010121 is 1210100002111.
It is not a de Polignac number, because 1112000010121 - 21 = 1112000010119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112000010098 and 1112000010107.
It is not an unprimeable number, because it can be changed into a prime (1112000010181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24126741 + ... + 24172786.
It is an arithmetic number, because the mean of its divisors is an integer number (48685924224).
Almost surely, 21112000010121 is an apocalyptic number.
1112000010121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1112000010121 is a deficient number, since it is larger than the sum of its proper divisors (445949565047).
1112000010121 is a wasteful number, since it uses less digits than its factorization.
1112000010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48299581.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1112000010121 its reverse (1210100002111), we get a palindrome (2322100012232).
The spelling of 1112000010121 in words is "one trillion, one hundred twelve billion, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •