Base | Representation |
---|---|
bin | 110000101111111001… |
… | …011101100100000000 |
3 | 12000002212222001202001 |
4 | 300233321131210000 |
5 | 1324144324400000 |
6 | 40013544233344 |
7 | 3532053600430 |
oct | 605771354400 |
9 | 160085861661 |
10 | 52343200000 |
11 | 2022040a983 |
12 | a18976b854 |
13 | 4c2235c0c0 |
14 | 2767a062c0 |
15 | 156544b46a |
hex | c2fe5d900 |
52343200000 has 432 divisors, whose sum is σ = 160954698240. Its totient is φ = 16542720000.
The previous prime is 52343199989. The next prime is 52343200051. The reversal of 52343200000 is 234325.
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 47 ways as a sum of consecutive naturals, for example, 72799641 + ... + 72800359.
It is an arithmetic number, because the mean of its divisors is an integer number (372580320).
Almost surely, 252343200000 is an apocalyptic number.
52343200000 is a gapful number since it is divisible by the number (50) 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 52343200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80477349120).
52343200000 is an abundant number, since it is smaller than the sum of its proper divisors (108611498240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52343200000 is an frugal number, since it uses more digits than its factorization.
52343200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 780 (or 746 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 19.
Adding to 52343200000 its reverse (234325), we get a palindrome (52343434325).
The spelling of 52343200000 in words is "fifty-two billion, three hundred forty-three million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •