Base | Representation |
---|---|
bin | 1101111010110100100101… |
… | …00101110000111111101101 |
3 | 11000101010121202201022100121 |
4 | 12331122102211300333231 |
5 | 13002441443424343340 |
6 | 145033145251524541 |
7 | 6306245411001343 |
oct | 675322245607755 |
9 | 130333552638317 |
10 | 30608396324845 |
11 | 9830a47847799 |
12 | 3524141bb9751 |
13 | 14104897653c1 |
14 | 77b6507c3993 |
15 | 3812dbd2b94a |
hex | 1bd692970fed |
30608396324845 has 8 divisors (see below), whose sum is σ = 36735596458776. Its totient is φ = 24483036480576.
The previous prime is 30608396324843. The next prime is 30608396324861. The reversal of 30608396324845 is 54842369380603.
It can be written as a sum of positive squares in 4 ways, for example, as 1455934237641 + 29152462087204 = 1206621^2 + 5399302^2 .
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 30608396324845 - 21 = 30608396324843 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30608396324843) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 460035822 + ... + 460102351.
It is an arithmetic number, because the mean of its divisors is an integer number (4591949557347).
Almost surely, 230608396324845 is an apocalyptic number.
It is an amenable number.
30608396324845 is a deficient number, since it is larger than the sum of its proper divisors (6127200133931).
30608396324845 is an equidigital number, since it uses as much as digits as its factorization.
30608396324845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920144831.
The product of its (nonzero) digits is 89579520, while the sum is 61.
The spelling of 30608396324845 in words is "thirty trillion, six hundred eight billion, three hundred ninety-six million, three hundred twenty-four thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •