Base | Representation |
---|---|
bin | 1101101010000000001101… |
… | …10001101100110100010001 |
3 | 10221022220000220220201112002 |
4 | 12311000012301230310101 |
5 | 12414010003401304203 |
6 | 143511455512243345 |
7 | 6216430256001623 |
oct | 665000661546421 |
9 | 127286026821462 |
10 | 30030525025553 |
11 | 96289685345a8 |
12 | 345014a0a0555 |
13 | 139ab3550c150 |
14 | 75b6b1422c13 |
15 | 371269a60d88 |
hex | 1b5006c6cd11 |
30030525025553 has 16 divisors (see below), whose sum is σ = 33790333973760. Its totient is φ = 26480944231104.
The previous prime is 30030525025511. The next prime is 30030525025559. The reversal of 30030525025553 is 35552052503003.
It is a cyclic number.
It is not a de Polignac number, because 30030525025553 - 26 = 30030525025489 is a prime.
It is a super-2 number, since 2×300305250255532 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30030525025559) 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 15 ways as a sum of consecutive naturals, for example, 64734293 + ... + 65196546.
It is an arithmetic number, because the mean of its divisors is an integer number (2111895873360).
Almost surely, 230030525025553 is an apocalyptic number.
It is an amenable number.
30030525025553 is a deficient number, since it is larger than the sum of its proper divisors (3759808948207).
30030525025553 is a wasteful number, since it uses less digits than its factorization.
30030525025553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129931648.
The product of its (nonzero) digits is 337500, while the sum is 38.
Adding to 30030525025553 its reverse (35552052503003), we get a palindrome (65582577528556).
The spelling of 30030525025553 in words is "thirty trillion, thirty billion, five hundred twenty-five million, twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •