Base | Representation |
---|---|
bin | 11101111110101101101… |
… | …11010101000010000001 |
3 | 10122110212120200002001121 |
4 | 32333112313111002001 |
5 | 113334122103341113 |
6 | 2105120005032241 |
7 | 134264613430033 |
oct | 16772667250201 |
9 | 3573776602047 |
10 | 1030102012033 |
11 | 367955805096 |
12 | 1477830b5681 |
13 | 761a482a193 |
14 | 37c00247c53 |
15 | 1bbde2e0e8d |
hex | efd6dd5081 |
1030102012033 has 2 divisors, whose sum is σ = 1030102012034. Its totient is φ = 1030102012032.
The previous prime is 1030102012021. The next prime is 1030102012039. The reversal of 1030102012033 is 3302102010301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 734332452624 + 295769559409 = 856932^2 + 543847^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030102012033 - 25 = 1030102012001 is a prime.
It is a super-2 number, since 2×10301020120332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030102011998 and 1030102012016.
It is not a weakly prime, because it can be changed into another prime (1030102012039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515051006016 + 515051006017.
It is an arithmetic number, because the mean of its divisors is an integer number (515051006017).
Almost surely, 21030102012033 is an apocalyptic number.
It is an amenable number.
1030102012033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030102012033 is an equidigital number, since it uses as much as digits as its factorization.
1030102012033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1030102012033 its reverse (3302102010301), we get a palindrome (4332204022334).
The spelling of 1030102012033 in words is "one trillion, thirty billion, one hundred two million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •