Base | Representation |
---|---|
bin | 1001100111001001… |
… | …01101111101010100 |
3 | 111022121212212211001 |
4 | 10303210231331110 |
5 | 41032004340430 |
6 | 2212013353044 |
7 | 241606144330 |
oct | 46344557524 |
9 | 14277785731 |
10 | 5160230740 |
11 | 22088a7805 |
12 | 1000198784 |
13 | 643100392 |
14 | 36d4907c0 |
15 | 2030573ca |
hex | 13392df54 |
5160230740 has 24 divisors (see below), whose sum is σ = 12384554112. Its totient is φ = 1769221920.
The previous prime is 5160230731. The next prime is 5160230749. The reversal of 5160230740 is 470320615.
It is an interprime number because it is at equal distance from previous prime (5160230731) and next prime (5160230749).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 5160230699 and 5160230708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5160230749) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18429256 + ... + 18429535.
It is an arithmetic number, because the mean of its divisors is an integer number (516023088).
Almost surely, 25160230740 is an apocalyptic number.
It is an amenable number.
5160230740 is an abundant number, since it is smaller than the sum of its proper divisors (7224323372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5160230740 is a wasteful number, since it uses less digits than its factorization.
5160230740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36858807 (or 36858805 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 5160230740 is about 71834.7460495268. The cubic root of 5160230740 is about 1728.0502765472.
The spelling of 5160230740 in words is "five billion, one hundred sixty million, two hundred thirty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •