Base | Representation |
---|---|
bin | 1001010110011011… |
… | …10110100010111000 |
3 | 110221212001101021220 |
4 | 10223031312202320 |
5 | 40240111100442 |
6 | 2150044232040 |
7 | 235254312351 |
oct | 45315664270 |
9 | 13855041256 |
10 | 5020018872 |
11 | 2146740530 |
12 | b8123b620 |
13 | 62004a78b |
14 | 3589d2d28 |
15 | 1e5aaceec |
hex | 12b3768b8 |
5020018872 has 64 divisors (see below), whose sum is σ = 13704768000. Its totient is φ = 1519683840.
The previous prime is 5020018867. The next prime is 5020018877. The reversal of 5020018872 is 2788100205.
It is an interprime number because it is at equal distance from previous prime (5020018867) and next prime (5020018877).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5020018877) 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 15 ways as a sum of consecutive naturals, for example, 267873 + ... + 285999.
It is an arithmetic number, because the mean of its divisors is an integer number (214137000).
Almost surely, 25020018872 is an apocalyptic number.
It is an amenable number.
5020018872 is an abundant number, since it is smaller than the sum of its proper divisors (8684749128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5020018872 is a wasteful number, since it uses less digits than its factorization.
5020018872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19196 (or 19192 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 33.
The square root of 5020018872 is about 70852.0915146476. The cubic root of 5020018872 is about 1712.2550270430.
The spelling of 5020018872 in words is "five billion, twenty million, eighteen thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •