Base | Representation |
---|---|
bin | 100110001001101010100… |
… | …1010111000000100000000 |
3 | 200120021020002211121002020 |
4 | 1030103111022320010000 |
5 | 1141402024220433300 |
6 | 15052445041321440 |
7 | 1050553146602064 |
oct | 114232512700400 |
9 | 20507202747066 |
10 | 5243436499200 |
11 | 1741802231489 |
12 | 708268336280 |
13 | 2c05b93caa73 |
14 | 141ad85c3aa4 |
15 | 915d91e48a0 |
hex | 4c4d52b8100 |
5243436499200 has 216 divisors, whose sum is σ = 17350115042400. Its totient is φ = 1394558484480.
The previous prime is 5243436499181. The next prime is 5243436499207. The reversal of 5243436499200 is 29946343425.
It is a super-2 number, since 2×52434364992002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5243436499207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6916516 + ... + 7637084.
Almost surely, 25243436499200 is an apocalyptic number.
5243436499200 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 5243436499200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8675057521200).
5243436499200 is an abundant number, since it is smaller than the sum of its proper divisors (12106678543200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5243436499200 is a wasteful number, since it uses less digits than its factorization.
5243436499200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720977 (or 720958 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 51.
The spelling of 5243436499200 in words is "five trillion, two hundred forty-three billion, four hundred thirty-six million, four hundred ninety-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •