Base | Representation |
---|---|
bin | 1101101100000111110100… |
… | …10111101101101111001111 |
3 | 10221120211221220211020210022 |
4 | 12312003322113231233033 |
5 | 12421203110310043043 |
6 | 144005140212132355 |
7 | 6224615420251106 |
oct | 666037227555717 |
9 | 127524856736708 |
10 | 30103331331023 |
11 | 9656829820495 |
12 | 34622889070bb |
13 | 13a4969180a82 |
14 | 76101aa2103d |
15 | 3730cb704868 |
hex | 1b60fa5edbcf |
30103331331023 has 2 divisors, whose sum is σ = 30103331331024. Its totient is φ = 30103331331022.
The previous prime is 30103331330987. The next prime is 30103331331067. The reversal of 30103331331023 is 32013313330103.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 30103331331023 - 28 = 30103331330767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30103331330983 and 30103331331001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30103301331023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051665665511 + 15051665665512.
It is an arithmetic number, because the mean of its divisors is an integer number (15051665665512).
Almost surely, 230103331331023 is an apocalyptic number.
30103331331023 is a deficient number, since it is larger than the sum of its proper divisors (1).
30103331331023 is an equidigital number, since it uses as much as digits as its factorization.
30103331331023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 30103331331023 its reverse (32013313330103), we get a palindrome (62116644661126).
The spelling of 30103331331023 in words is "thirty trillion, one hundred three billion, three hundred thirty-one million, three hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •