Base | Representation |
---|---|
bin | 1101111000111110000001… |
… | …10010111010110000100000 |
3 | 11000011001022221022100212220 |
4 | 12330133000302322300200 |
5 | 13000421120213441300 |
6 | 144544021342151040 |
7 | 6301533206541045 |
oct | 674370062726040 |
9 | 130131287270786 |
10 | 30544747015200 |
11 | 9806a55432350 |
12 | 3513939b82480 |
13 | 1407484c51cc2 |
14 | 7785333c71cc |
15 | 37e814026da0 |
hex | 1bc7c0cbac20 |
30544747015200 has 288 divisors, whose sum is σ = 108471181275072. Its totient is φ = 7404134400000.
The previous prime is 30544747015177. The next prime is 30544747015219. The reversal of 30544747015200 is 251074744503.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 343181904 + ... + 343270896.
It is an arithmetic number, because the mean of its divisors is an integer number (376636046094).
Almost surely, 230544747015200 is an apocalyptic number.
30544747015200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30544747015200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54235590637536).
30544747015200 is an abundant number, since it is smaller than the sum of its proper divisors (77926434259872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30544747015200 is a wasteful number, since it uses less digits than its factorization.
30544747015200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102028 (or 102015 counting only the distinct ones).
The product of its (nonzero) digits is 470400, while the sum is 42.
The spelling of 30544747015200 in words is "thirty trillion, five hundred forty-four billion, seven hundred forty-seven million, fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.858 sec. • engine limits •