Base | Representation |
---|---|
bin | 1110000100010000011111… |
… | …10100001100001101101101 |
3 | 11001112010111110101122200201 |
4 | 13002020033310030031231 |
5 | 13023300001132234144 |
6 | 145442125510153501 |
7 | 6341544104055520 |
oct | 702101764141555 |
9 | 131463443348621 |
10 | 30932619805549 |
11 | 99464a5517630 |
12 | 3576b47952891 |
13 | 1434c19c79137 |
14 | 78d20aad6bb7 |
15 | 389965e231d4 |
hex | 1c220fd0c36d |
30932619805549 has 32 divisors (see below), whose sum is σ = 38680287528960. Its totient is φ = 24031568721600.
The previous prime is 30932619805543. The next prime is 30932619805553. The reversal of 30932619805549 is 94550891623903.
It is not a de Polignac number, because 30932619805549 - 23 = 30932619805541 is a prime.
It is a super-3 number, since 3×309326198055493 (a number of 41 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (64) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30932619805541) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54338104 + ... + 54904414.
It is an arithmetic number, because the mean of its divisors is an integer number (1208758985280).
Almost surely, 230932619805549 is an apocalyptic number.
It is an amenable number.
30932619805549 is a deficient number, since it is larger than the sum of its proper divisors (7747667723411).
30932619805549 is a wasteful number, since it uses less digits than its factorization.
30932619805549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568441.
The product of its (nonzero) digits is 62985600, while the sum is 64.
The spelling of 30932619805549 in words is "thirty trillion, nine hundred thirty-two billion, six hundred nineteen million, eight hundred five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •