Base | Representation |
---|---|
bin | 1101111101111010111010… |
… | …00001000110110000011000 |
3 | 11000202022110012221000201010 |
4 | 12332331131001012300120 |
5 | 13011213024124021400 |
6 | 145154114532453520 |
7 | 6320035103541126 |
oct | 676753501066030 |
9 | 130668405830633 |
10 | 30714871704600 |
11 | 9872116384506 |
12 | 35408b847a2a0 |
13 | 141a5279855a5 |
14 | 78287183a916 |
15 | 383e6e7a2450 |
hex | 1bef5d046c18 |
30714871704600 has 96 divisors (see below), whose sum is σ = 95226423132240. Its totient is φ = 8189744640000.
The previous prime is 30714871704593. The next prime is 30714871704617. The reversal of 30714871704600 is 640717841703.
It is a super-2 number, since 2×307148717046002 (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 30714871704600.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2774800 + ... + 8314400.
Almost surely, 230714871704600 is an apocalyptic number.
30714871704600 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30714871704600 is an abundant number, since it is smaller than the sum of its proper divisors (64511551427640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30714871704600 is a wasteful number, since it uses less digits than its factorization.
30714871704600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5548861 (or 5548852 counting only the distinct ones).
The product of its (nonzero) digits is 790272, while the sum is 48.
The spelling of 30714871704600 in words is "thirty trillion, seven hundred fourteen billion, eight hundred seventy-one million, seven hundred four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •