Base | Representation |
---|---|
bin | 11101101011111010111… |
… | …01000001101000110001 |
3 | 10121111211101112212101211 |
4 | 32311331131001220301 |
5 | 113202441033310113 |
6 | 2100330445200121 |
7 | 133456564013422 |
oct | 16657535015061 |
9 | 3544741485354 |
10 | 1020012010033 |
11 | 363648208265 |
12 | 145827b60041 |
13 | 752572b9bb3 |
14 | 37524177649 |
15 | 1b7ed5a5b3d |
hex | ed7d741a31 |
1020012010033 has 2 divisors, whose sum is σ = 1020012010034. Its totient is φ = 1020012010032.
The previous prime is 1020012009979. The next prime is 1020012010051. The reversal of 1020012010033 is 3300102100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 717090563344 + 302921446689 = 846812^2 + 550383^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020012010033 - 217 = 1020011878961 is a prime.
It is a super-2 number, since 2×10200120100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020012009995 and 1020012010022.
It is not a weakly prime, because it can be changed into another prime (1020012010093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510006005016 + 510006005017.
It is an arithmetic number, because the mean of its divisors is an integer number (510006005017).
Almost surely, 21020012010033 is an apocalyptic number.
It is an amenable number.
1020012010033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020012010033 is an equidigital number, since it uses as much as digits as its factorization.
1020012010033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1020012010033 its reverse (3300102100201), we get a palindrome (4320114110234).
The spelling of 1020012010033 in words is "one trillion, twenty billion, twelve million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •