Base | Representation |
---|---|
bin | 1101110110001010000111… |
… | …00101001111010011000000 |
3 | 10222210211000102011001000000 |
4 | 12323011003211033103000 |
5 | 12442330311142344200 |
6 | 144431405031000000 |
7 | 6261543500121624 |
oct | 673050345172300 |
9 | 128724012131000 |
10 | 30448156996800 |
11 | 9779a9992a964 |
12 | 34b9082209000 |
13 | 13cb330a5176a |
14 | 7739ad1b1184 |
15 | 37c05e367300 |
hex | 1bb14394f4c0 |
30448156996800 has 588 divisors, whose sum is σ = 115954571743936. Its totient is φ = 7857579571200.
The previous prime is 30448156996793. The next prime is 30448156996813. The reversal of 30448156996800 is 869965184403.
30448156996800 is a `hidden beast` number, since 3 + 0 + 4 + 4 + 8 + 1 + 569 + 9 + 68 + 0 + 0 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 35737362 + ... + 36579438.
Almost surely, 230448156996800 is an apocalyptic number.
30448156996800 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 30448156996800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57977285871968).
30448156996800 is an abundant number, since it is smaller than the sum of its proper divisors (85506414747136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30448156996800 is an equidigital number, since it uses as much as digits as its factorization.
30448156996800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 842148 (or 842118 counting only the distinct ones).
The product of its (nonzero) digits is 44789760, while the sum is 63.
The spelling of 30448156996800 in words is "thirty trillion, four hundred forty-eight billion, one hundred fifty-six million, nine hundred ninety-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •