Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …010001100111000110100001 |
3 | 112200120002120122022001110102 |
4 | 121131310020101213012201 |
5 | 104140002000224342004 |
6 | 1034112031250312145 |
7 | 32406506301601466 |
oct | 3135641021470641 |
9 | 480502518261412 |
10 | 112000001012129 |
11 | 32760a2a81244a |
12 | 1068a425888655 |
13 | 4a65729acb409 |
14 | 1d92b869b566d |
15 | ce359c84011e |
hex | 65dd084671a1 |
112000001012129 has 2 divisors, whose sum is σ = 112000001012130. Its totient is φ = 112000001012128.
The previous prime is 112000001012083. The next prime is 112000001012191. The reversal of 112000001012129 is 921210100000211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69656049840400 + 42343951171729 = 8346020^2 + 6507223^2 .
It is a cyclic number.
It is not a de Polignac number, because 112000001012129 - 216 = 112000000946593 is a prime.
It is a super-2 number, since 2×1120000010121292 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112000001012129.
It is not a weakly prime, because it can be changed into another prime (112000001012629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000000506064 + 56000000506065.
It is an arithmetic number, because the mean of its divisors is an integer number (56000000506065).
Almost surely, 2112000001012129 is an apocalyptic number.
It is an amenable number.
112000001012129 is a deficient number, since it is larger than the sum of its proper divisors (1).
112000001012129 is an equidigital number, since it uses as much as digits as its factorization.
112000001012129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 112000001012129 in words is "one hundred twelve trillion, one million, twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •