Base | Representation |
---|---|
bin | 10101001000010101001… |
… | …111011000101011000000 |
3 | 12010211000020020001202120 |
4 | 111020111033120223000 |
5 | 142242302124111200 |
6 | 3031022012244240 |
7 | 206623166260266 |
oct | 25102517305300 |
9 | 5124006201676 |
10 | 1452055300800 |
11 | 50a8a43a9245 |
12 | 1b5502470680 |
13 | a6c0b414000 |
14 | 503cbcac436 |
15 | 27b8818c9a0 |
hex | 152153d8ac0 |
1452055300800 has 672 divisors, whose sum is σ = 5433135590400. Its totient is φ = 338570219520.
The previous prime is 1452055300769. The next prime is 1452055300853. The reversal of 1452055300800 is 80035502541.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 200362777 + ... + 200370023.
It is an arithmetic number, because the mean of its divisors is an integer number (8085023200).
Almost surely, 21452055300800 is an apocalyptic number.
1452055300800 is a gapful number since it is divisible by the number (10) 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 1452055300800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2716567795200).
1452055300800 is an abundant number, since it is smaller than the sum of its proper divisors (3981080289600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1452055300800 is a wasteful number, since it uses less digits than its factorization.
1452055300800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7330 (or 7289 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 33.
The spelling of 1452055300800 in words is "one trillion, four hundred fifty-two billion, fifty-five million, three hundred thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •