Base | Representation |
---|---|
bin | 1001011000000010… |
… | …10111000000110000 |
3 | 110222210110101000010 |
4 | 10230001113000300 |
5 | 40302040134300 |
6 | 2151245454520 |
7 | 235510136631 |
oct | 45401270060 |
9 | 13883411003 |
10 | 5033521200 |
11 | 2153322a84 |
12 | b85871440 |
13 | 622a97516 |
14 | 35a709888 |
15 | 1e6d78a50 |
hex | 12c057030 |
5033521200 has 60 divisors (see below), whose sum is σ = 16124050088. Its totient is φ = 1342272000.
The previous prime is 5033521183. The next prime is 5033521217. The reversal of 5033521200 is 21253305.
It is an interprime number because it is at equal distance from previous prime (5033521183) and next prime (5033521217).
It is a tau number, because it is divible by the number of its divisors (60).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2096101 + ... + 2098500.
Almost surely, 25033521200 is an apocalyptic number.
5033521200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5033521200 is an abundant number, since it is smaller than the sum of its proper divisors (11090528888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5033521200 is a wasteful number, since it uses less digits than its factorization.
5033521200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4194622 (or 4194611 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 5033521200 is about 70947.3128455194. The cubic root of 5033521200 is about 1713.7888016109.
Adding to 5033521200 its reverse (21253305), we get a palindrome (5054774505).
The spelling of 5033521200 in words is "five billion, thirty-three million, five hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •