Base | Representation |
---|---|
bin | 11101111110110001011… |
… | …10000010001110001001 |
3 | 10122110221202020001001101 |
4 | 32333120232002032021 |
5 | 113334203040130441 |
6 | 2105123040021401 |
7 | 134265442063234 |
oct | 16773056021611 |
9 | 3573852201041 |
10 | 1030133130121 |
11 | 367971329617 |
12 | 147791601861 |
13 | 761ab104054 |
14 | 37c0442841b |
15 | 1bbe1ddb231 |
hex | efd8b82389 |
1030133130121 has 2 divisors, whose sum is σ = 1030133130122. Its totient is φ = 1030133130120.
The previous prime is 1030133130053. The next prime is 1030133130127. The reversal of 1030133130121 is 1210313310301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 700341354496 + 329791775625 = 836864^2 + 574275^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030133130121 - 215 = 1030133097353 is a prime.
It is a super-2 number, since 2×10301331301212 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1030133130127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515066565060 + 515066565061.
It is an arithmetic number, because the mean of its divisors is an integer number (515066565061).
Almost surely, 21030133130121 is an apocalyptic number.
It is an amenable number.
1030133130121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030133130121 is an equidigital number, since it uses as much as digits as its factorization.
1030133130121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1030133130121 its reverse (1210313310301), we get a palindrome (2240446440422).
The spelling of 1030133130121 in words is "one trillion, thirty billion, one hundred thirty-three million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •