Base | Representation |
---|---|
bin | 1001100100110100… |
… | …01101011101010000 |
3 | 111021021010120020210 |
4 | 10302122031131100 |
5 | 41012004331320 |
6 | 2210035004120 |
7 | 241251135345 |
oct | 46232153520 |
9 | 14237116223 |
10 | 5140698960 |
11 | 21a8877241 |
12 | bb5739640 |
13 | 63c052107 |
14 | 36aa487cc |
15 | 20149a0e0 |
hex | 13268d750 |
5140698960 has 160 divisors (see below), whose sum is σ = 16306634880. Its totient is φ = 1339213824.
The previous prime is 5140698923. The next prime is 5140698961. The reversal of 5140698960 is 698960415.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5140698961) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3522711 + ... + 3524169.
It is an arithmetic number, because the mean of its divisors is an integer number (101916468).
Almost surely, 25140698960 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5140698960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8153317440).
5140698960 is an abundant number, since it is smaller than the sum of its proper divisors (11165935920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5140698960 is a wasteful number, since it uses less digits than its factorization.
5140698960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1805 (or 1799 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 48.
The square root of 5140698960 is about 71698.6677700500. The cubic root of 5140698960 is about 1725.8672622842.
The spelling of 5140698960 in words is "five billion, one hundred forty million, six hundred ninety-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •