Base | Representation |
---|---|
bin | 100110100110111010010… |
… | …1110001010000000000000 |
3 | 200210021100012002200000000 |
4 | 1031031310232022000000 |
5 | 1143414141133222300 |
6 | 15141353200000000 |
7 | 1055235434116512 |
oct | 115156456120000 |
9 | 20707305080000 |
10 | 5306242867200 |
11 | 1766401846340 |
12 | 718476000000 |
13 | 2c64b83a4822 |
14 | 144b75a77bb2 |
15 | 93062eddc00 |
hex | 4d374b8a000 |
5306242867200 has 1512 divisors, whose sum is σ = 21591265793760. Its totient is φ = 1282778726400.
The previous prime is 5306242867151. The next prime is 5306242867229. The reversal of 5306242867200 is 27682426035.
5306242867200 is a `hidden beast` number, since 5 + 306 + 242 + 86 + 7 + 20 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 14780620621 + ... + 14780620979.
Almost surely, 25306242867200 is an apocalyptic number.
5306242867200 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 5306242867200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10795632896880).
5306242867200 is an abundant number, since it is smaller than the sum of its proper divisors (16285022926560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5306242867200 is an frugal number, since it uses more digits than its factorization.
5306242867200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 430 (or 380 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 45.
The spelling of 5306242867200 in words is "five trillion, three hundred six billion, two hundred forty-two million, eight hundred sixty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •