Base | Representation |
---|---|
bin | 1001101001100001… |
… | …00011111111100001 |
3 | 111101000021222222001 |
4 | 10310300203333201 |
5 | 41102102102430 |
6 | 2214003444001 |
7 | 242240142604 |
oct | 46460437741 |
9 | 14330258861 |
10 | 5180112865 |
11 | 2219047514 |
12 | 1006986601 |
13 | 647271c55 |
14 | 371d8833b |
15 | 204b833ca |
hex | 134c23fe1 |
5180112865 has 8 divisors (see below), whose sum is σ = 6416656128. Its totient is φ = 4010409840.
The previous prime is 5180112853. The next prime is 5180112869. The reversal of 5180112865 is 5682110815.
5180112865 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5180112865 - 27 = 5180112737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5180112869) 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, 16709887 + ... + 16710196.
It is an arithmetic number, because the mean of its divisors is an integer number (802082016).
Almost surely, 25180112865 is an apocalyptic number.
It is an amenable number.
5180112865 is a deficient number, since it is larger than the sum of its proper divisors (1236543263).
5180112865 is a wasteful number, since it uses less digits than its factorization.
5180112865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33420119.
The product of its (nonzero) digits is 19200, while the sum is 37.
The square root of 5180112865 is about 71973.0009447987. Note that the first 3 decimals coincide. The cubic root of 5180112865 is about 1730.2667975934.
The spelling of 5180112865 in words is "five billion, one hundred eighty million, one hundred twelve thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •