Base | Representation |
---|---|
bin | 1001110010000101… |
… | …10110101110111000 |
3 | 111120000121010000010 |
4 | 10321002312232320 |
5 | 41224004021310 |
6 | 2225052541520 |
7 | 244102260102 |
oct | 47102665670 |
9 | 14500533003 |
10 | 5252017080 |
11 | 2255699192 |
12 | 1026a818a0 |
13 | 65912941b |
14 | 37b744572 |
15 | 20b138320 |
hex | 1390b6bb8 |
5252017080 has 32 divisors (see below), whose sum is σ = 15756051600. Its totient is φ = 1400537856.
The previous prime is 5252017079. The next prime is 5252017081. The reversal of 5252017080 is 807102525.
It is an interprime number because it is at equal distance from previous prime (5252017079) and next prime (5252017081).
It is a super-2 number, since 2×52520170802 = 55167366817223452800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5252017081) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 21883285 + ... + 21883524.
Almost surely, 25252017080 is an apocalyptic number.
It is an amenable number.
5252017080 is an abundant number, since it is smaller than the sum of its proper divisors (10504034520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5252017080 is a wasteful number, since it uses less digits than its factorization.
5252017080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43766823 (or 43766819 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 30.
The square root of 5252017080 is about 72470.8015686318. The cubic root of 5252017080 is about 1738.2358788265.
The spelling of 5252017080 in words is "five billion, two hundred fifty-two million, seventeen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •