Base | Representation |
---|---|
bin | 1101101100000101111101… |
… | …10111011110010000000001 |
3 | 10221120202101100022221221201 |
4 | 12312002332313132100001 |
5 | 12421144034223220413 |
6 | 144004453151021201 |
7 | 6224551605625552 |
oct | 666027667362001 |
9 | 127522340287851 |
10 | 30102333023233 |
11 | 9656367253029 |
12 | 346204a50a801 |
13 | 13a483a3b6bc3 |
14 | 760d641d4329 |
15 | 37306dc599dd |
hex | 1b60bedde401 |
30102333023233 has 2 divisors, whose sum is σ = 30102333023234. Its totient is φ = 30102333023232.
The previous prime is 30102333023143. The next prime is 30102333023239. The reversal of 30102333023233 is 33232033320103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29122773488704 + 979559534529 = 5396552^2 + 989727^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30102333023233 is a prime.
It is not a weakly prime, because it can be changed into another prime (30102333023239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051166511616 + 15051166511617.
It is an arithmetic number, because the mean of its divisors is an integer number (15051166511617).
Almost surely, 230102333023233 is an apocalyptic number.
It is an amenable number.
30102333023233 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102333023233 is an equidigital number, since it uses as much as digits as its factorization.
30102333023233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 30102333023233 its reverse (33232033320103), we get a palindrome (63334366343336).
The spelling of 30102333023233 in words is "thirty trillion, one hundred two billion, three hundred thirty-three million, twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •