Base | Representation |
---|---|
bin | 110000101000000110… |
… | …101101011111101000 |
3 | 11222202202221112212110 |
4 | 300220012231133220 |
5 | 1323412342033100 |
6 | 35552554042320 |
7 | 3525605356020 |
oct | 605006553750 |
9 | 158682845773 |
10 | 52212455400 |
11 | 2016362a596 |
12 | a151a193a0 |
13 | 4c01242731 |
14 | 27544d0a80 |
15 | 1558c22250 |
hex | c281ad7e8 |
52212455400 has 96 divisors (see below), whose sum is σ = 184981285440. Its totient is φ = 11934274560.
The previous prime is 52212455387. The next prime is 52212455509. The reversal of 52212455400 is 455421225.
It is a super-2 number, since 2×522124554002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 23 ways as a sum of consecutive naturals, for example, 6211569 + ... + 6219968.
It is an arithmetic number, because the mean of its divisors is an integer number (1926888390).
Almost surely, 252212455400 is an apocalyptic number.
52212455400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52212455400 is an abundant number, since it is smaller than the sum of its proper divisors (132768830040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52212455400 is a wasteful number, since it uses less digits than its factorization.
52212455400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12431563 (or 12431554 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 30.
Adding to 52212455400 its reverse (455421225), we get a palindrome (52667876625).
The spelling of 52212455400 in words is "fifty-two billion, two hundred twelve million, four hundred fifty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •