Base | Representation |
---|---|
bin | 1001100110001010… |
… | …10101000010011000 |
3 | 111022001101211101022 |
4 | 10303011111002120 |
5 | 41022403032300 |
6 | 2211121142012 |
7 | 241446203402 |
oct | 46305250230 |
9 | 14261354338 |
10 | 5152002200 |
11 | 2204197564 |
12 | bb948a908 |
13 | 6414abc17 |
14 | 36c34bb72 |
15 | 20247e285 |
hex | 133155098 |
5152002200 has 24 divisors (see below), whose sum is σ = 11978405580. Its totient is φ = 2060800800.
The previous prime is 5152002197. The next prime is 5152002203. The reversal of 5152002200 is 22002515.
It is an interprime number because it is at equal distance from previous prime (5152002197) and next prime (5152002203).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5152002203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12879806 + ... + 12880205.
Almost surely, 25152002200 is an apocalyptic number.
5152002200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5152002200 is an abundant number, since it is smaller than the sum of its proper divisors (6826403380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5152002200 is a wasteful number, since it uses less digits than its factorization.
5152002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25760027 (or 25760018 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 17.
The square root of 5152002200 is about 71777.4491048547. The cubic root of 5152002200 is about 1727.1312675387.
Adding to 5152002200 its reverse (22002515), we get a palindrome (5174004715).
The spelling of 5152002200 in words is "five billion, one hundred fifty-two million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •