Base | Representation |
---|---|
bin | 1101101100111101001110… |
… | …10010011110100011001001 |
3 | 10221200120222001011022220212 |
4 | 12312132213102132203021 |
5 | 12422140320032021413 |
6 | 144030241204530505 |
7 | 6226652050633304 |
oct | 666364722364311 |
9 | 127616861138825 |
10 | 30132002220233 |
11 | 9667a01793951 |
12 | 346794a6b0a35 |
13 | 13a7588087884 |
14 | 76257a72bb3b |
15 | 373c087dcca8 |
hex | 1b67a749e8c9 |
30132002220233 has 2 divisors, whose sum is σ = 30132002220234. Its totient is φ = 30132002220232.
The previous prime is 30132002220209. The next prime is 30132002220247. The reversal of 30132002220233 is 33202220023103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26299224988729 + 3832777231504 = 5128277^2 + 1957748^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30132002220233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30132002220199 and 30132002220208.
It is not a weakly prime, because it can be changed into another prime (30132002220833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15066001110116 + 15066001110117.
It is an arithmetic number, because the mean of its divisors is an integer number (15066001110117).
Almost surely, 230132002220233 is an apocalyptic number.
It is an amenable number.
30132002220233 is a deficient number, since it is larger than the sum of its proper divisors (1).
30132002220233 is an equidigital number, since it uses as much as digits as its factorization.
30132002220233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 30132002220233 its reverse (33202220023103), we get a palindrome (63334222243336).
The spelling of 30132002220233 in words is "thirty trillion, one hundred thirty-two billion, two million, two hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •