Base | Representation |
---|---|
bin | 1101110000011001011100… |
… | …10110010000101100010000 |
3 | 10222002220010200211022002202 |
4 | 12320030232112100230100 |
5 | 12431104433424100300 |
6 | 144200433112502332 |
7 | 6241335645425051 |
oct | 670145626205420 |
9 | 128086120738082 |
10 | 30250232253200 |
11 | 97030625375a3 |
12 | 34868456aa9a8 |
13 | 13b577a668b6b |
14 | 768194978728 |
15 | 376d281bdad5 |
hex | 1b832e590b10 |
30250232253200 has 120 divisors (see below), whose sum is σ = 73742243605056. Its totient is φ = 11922797376000.
The previous prime is 30250232253139. The next prime is 30250232253211. The reversal of 30250232253200 is 235223205203.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 49138499 + ... + 49750301.
Almost surely, 230250232253200 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30250232253200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36871121802528).
30250232253200 is an abundant number, since it is smaller than the sum of its proper divisors (43492011351856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30250232253200 is a wasteful number, since it uses less digits than its factorization.
30250232253200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613633 (or 613622 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 29.
Adding to 30250232253200 its reverse (235223205203), we get a palindrome (30485455458403).
The spelling of 30250232253200 in words is "thirty trillion, two hundred fifty billion, two hundred thirty-two million, two hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •