Base | Representation |
---|---|
bin | 1101110110010011100000… |
… | …01011010110101001110000 |
3 | 10222211022000212201221000101 |
4 | 12323021300023112221300 |
5 | 12442421123214400300 |
6 | 144434001303202144 |
7 | 6262112455211536 |
oct | 673116013265160 |
9 | 128738025657011 |
10 | 30453200153200 |
11 | 9781147633a10 |
12 | 34ba04b146354 |
13 | 13cb955810786 |
14 | 773d2aca8156 |
15 | 37c256e95b6a |
hex | 1bb2702d6a70 |
30453200153200 has 480 divisors, whose sum is σ = 84189637232640. Its totient is φ = 10486771200000.
The previous prime is 30453200153191. The next prime is 30453200153213. The reversal of 30453200153200 is 235100235403.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 970109505 + ... + 970140895.
It is an arithmetic number, because the mean of its divisors is an integer number (175395077568).
Almost surely, 230453200153200 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 30453200153200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42094818616320).
30453200153200 is an abundant number, since it is smaller than the sum of its proper divisors (53736437079440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30453200153200 is a wasteful number, since it uses less digits than its factorization.
30453200153200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31617 (or 31606 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 30453200153200 its reverse (235100235403), we get a palindrome (30688300388603).
The spelling of 30453200153200 in words is "thirty trillion, four hundred fifty-three billion, two hundred million, one hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •