Base | Representation |
---|---|
bin | 1101101100001000000011… |
… | …00100100010111001011001 |
3 | 10221120212021100010201200201 |
4 | 12312010001210202321121 |
5 | 12421203332221310001 |
6 | 144005200205302201 |
7 | 6224621415131230 |
oct | 666040144427131 |
9 | 127525240121621 |
10 | 30103452135001 |
11 | 9656890a31293 |
12 | 3462301264961 |
13 | 13a49881c990b |
14 | 76102caa9b17 |
15 | 3730d7118501 |
hex | 1b6101922e59 |
30103452135001 has 8 divisors (see below), whose sum is σ = 34541012810304. Its totient is φ = 25700158338000.
The previous prime is 30103452134953. The next prime is 30103452135041. The reversal of 30103452135001 is 10053125430103.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30103452135001 - 227 = 30103317917273 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30103452135041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8566717690 + ... + 8566721203.
It is an arithmetic number, because the mean of its divisors is an integer number (4317626601288).
Almost surely, 230103452135001 is an apocalyptic number.
It is an amenable number.
30103452135001 is a deficient number, since it is larger than the sum of its proper divisors (4437560675303).
30103452135001 is a wasteful number, since it uses less digits than its factorization.
30103452135001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17133439151.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 30103452135001 its reverse (10053125430103), we get a palindrome (40156577565104).
The spelling of 30103452135001 in words is "thirty trillion, one hundred three billion, four hundred fifty-two million, one hundred thirty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •