Base | Representation |
---|---|
bin | 1101111010110000100001… |
… | …00100111100110101101010 |
3 | 11000100220222202022020112001 |
4 | 12331120100210330311222 |
5 | 13002423012024320010 |
6 | 145032145012041214 |
7 | 6306140353446034 |
oct | 675302044746552 |
9 | 130326882266461 |
10 | 30606215073130 |
11 | 9830028563024 |
12 | 352383360320a |
13 | 14101cc899508 |
14 | 77b4c4c26c54 |
15 | 3812105b4c3a |
hex | 1bd61093cd6a |
30606215073130 has 8 divisors (see below), whose sum is σ = 55091187131652. Its totient is φ = 12242486029248.
The previous prime is 30606215073103. The next prime is 30606215073139. The reversal of 30606215073130 is 3137051260603.
It can be written as a sum of positive squares in 2 ways, for example, as 26112294180361 + 4493920892769 = 5110019^2 + 2119887^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×306062150731302 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30606215073130.
It is not an unprimeable number, because it can be changed into a prime (30606215073139) 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 in 3 ways as a sum of consecutive naturals, for example, 1530310753647 + ... + 1530310753666.
Almost surely, 230606215073130 is an apocalyptic number.
30606215073130 is a deficient number, since it is larger than the sum of its proper divisors (24484972058522).
30606215073130 is a wasteful number, since it uses less digits than its factorization.
30606215073130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3060621507320.
The product of its (nonzero) digits is 68040, while the sum is 37.
The spelling of 30606215073130 in words is "thirty trillion, six hundred six billion, two hundred fifteen million, seventy-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •