Base | Representation |
---|---|
bin | 110001011000001111… |
… | …101011000101100000 |
3 | 12001212001200201100020 |
4 | 301120033223011200 |
5 | 1332041122024300 |
6 | 40205044553440 |
7 | 3554613336450 |
oct | 613017530540 |
9 | 161761621306 |
10 | 53020111200 |
11 | 2053851a321 |
12 | a3383b2880 |
13 | 4ccc676184 |
14 | 27cd88dd60 |
15 | 15a4aac8a0 |
hex | c583eb160 |
53020111200 has 144 divisors (see below), whose sum is σ = 197234876160. Its totient is φ = 12118878720.
The previous prime is 53020111187. The next prime is 53020111283. The reversal of 53020111200 is 211102035.
It is a super-2 number, since 2×530201112002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 53020111200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1561180 + ... + 1594779.
It is an arithmetic number, because the mean of its divisors is an integer number (1369686640).
Almost surely, 253020111200 is an apocalyptic number.
53020111200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53020111200 is an abundant number, since it is smaller than the sum of its proper divisors (144214764960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53020111200 is a wasteful number, since it uses less digits than its factorization.
53020111200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3155989 (or 3155976 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 53020111200 its reverse (211102035), we get a palindrome (53231213235).
The spelling of 53020111200 in words is "fifty-three billion, twenty million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •