Base | Representation |
---|---|
bin | 110001010111110110… |
… | …100010001001101000 |
3 | 12001211121021220021202 |
4 | 301113312202021220 |
5 | 1332032430133000 |
6 | 40204251423332 |
7 | 3554503331156 |
oct | 612766421150 |
9 | 161747256252 |
10 | 53013521000 |
11 | 20534828a80 |
12 | a336154b48 |
13 | 4ccb1a964b |
14 | 27cca563d6 |
15 | 15a4209dd5 |
hex | c57da2268 |
53013521000 has 64 divisors (see below), whose sum is σ = 135329088960. Its totient is φ = 19277640000.
The previous prime is 53013520957. The next prime is 53013521017. The reversal of 53013521000 is 12531035.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 15 ways as a sum of consecutive naturals, for example, 2398706 + ... + 2420705.
It is an arithmetic number, because the mean of its divisors is an integer number (2114517015).
Almost surely, 253013521000 is an apocalyptic number.
53013521000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53013521000 is an abundant number, since it is smaller than the sum of its proper divisors (82315567960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53013521000 is a wasteful number, since it uses less digits than its factorization.
53013521000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4819443 (or 4819429 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 20.
The spelling of 53013521000 in words is "fifty-three billion, thirteen million, five hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •