Base | Representation |
---|---|
bin | 11101011101000000111… |
… | …11110100110111100001 |
3 | 10120202011201101020220002 |
4 | 32232200133310313201 |
5 | 113040044030342004 |
6 | 2052524434425345 |
7 | 133054360112444 |
oct | 16564037646741 |
9 | 3522151336802 |
10 | 1012010012129 |
11 | 3602112a5856 |
12 | 144174132255 |
13 | 745805275ac |
14 | 36da550d65b |
15 | 1b4d0d1361e |
hex | eba07f4de1 |
1012010012129 has 2 divisors, whose sum is σ = 1012010012130. Its totient is φ = 1012010012128.
The previous prime is 1012010012089. The next prime is 1012010012147. The reversal of 1012010012129 is 9212100102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 779900934400 + 232109077729 = 883120^2 + 481777^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012010012129 - 236 = 943290535393 is a prime.
It is a super-2 number, since 2×10120100121292 (a number of 25 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 1012010012129.
It is not a weakly prime, because it can be changed into another prime (1012010017129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506005006064 + 506005006065.
It is an arithmetic number, because the mean of its divisors is an integer number (506005006065).
Almost surely, 21012010012129 is an apocalyptic number.
It is an amenable number.
1012010012129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012010012129 is an equidigital number, since it uses as much as digits as its factorization.
1012010012129 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 1012010012129 in words is "one trillion, twelve billion, ten million, twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •