Base | Representation |
---|---|
bin | 11101011101001011101… |
… | …11111010010101000001 |
3 | 10120202102000002212220021 |
4 | 32232211313322111001 |
5 | 113040240123241113 |
6 | 2052541420013441 |
7 | 133056533600101 |
oct | 16564567722501 |
9 | 3522360085807 |
10 | 1012100212033 |
11 | 360258203329 |
12 | 14419a391281 |
13 | 74596119511 |
14 | 36db34ad201 |
15 | 1b4d8bce48d |
hex | eba5dfa541 |
1012100212033 has 2 divisors, whose sum is σ = 1012100212034. Its totient is φ = 1012100212032.
The previous prime is 1012100211949. The next prime is 1012100212037. The reversal of 1012100212033 is 3302120012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 771143909904 + 240956302129 = 878148^2 + 490873^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012100212033 - 217 = 1012100080961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012100211998 and 1012100212016.
It is not a weakly prime, because it can be changed into another prime (1012100212037) 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, 506050106016 + 506050106017.
It is an arithmetic number, because the mean of its divisors is an integer number (506050106017).
Almost surely, 21012100212033 is an apocalyptic number.
It is an amenable number.
1012100212033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012100212033 is an equidigital number, since it uses as much as digits as its factorization.
1012100212033 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 16.
Adding to 1012100212033 its reverse (3302120012101), we get a palindrome (4314220224134).
The spelling of 1012100212033 in words is "one trillion, twelve billion, one hundred million, two hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •