Base | Representation |
---|---|
bin | 11101111110110001011… |
… | …01100011111110011001 |
3 | 10122110221201222202002221 |
4 | 32333120231203332121 |
5 | 113334203022144413 |
6 | 2105123033224041 |
7 | 134265441036112 |
oct | 16773055437631 |
9 | 3573851882087 |
10 | 1030133006233 |
11 | 367971254531 |
12 | 147791562021 |
13 | 761ab08c846 |
14 | 37c043d5209 |
15 | 1bbe1db468d |
hex | efd8b63f99 |
1030133006233 has 2 divisors, whose sum is σ = 1030133006234. Its totient is φ = 1030133006232.
The previous prime is 1030133006219. The next prime is 1030133006261. The reversal of 1030133006233 is 3326003310301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 890280941209 + 139852065024 = 943547^2 + 373968^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030133006233 is a prime.
It is a super-2 number, since 2×10301330062332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030133006198 and 1030133006207.
It is not a weakly prime, because it can be changed into another prime (1030133006633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515066503116 + 515066503117.
It is an arithmetic number, because the mean of its divisors is an integer number (515066503117).
Almost surely, 21030133006233 is an apocalyptic number.
It is an amenable number.
1030133006233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030133006233 is an equidigital number, since it uses as much as digits as its factorization.
1030133006233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 1030133006233 its reverse (3326003310301), we get a palindrome (4356136316534).
The spelling of 1030133006233 in words is "one trillion, thirty billion, one hundred thirty-three million, six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •