Base | Representation |
---|---|
bin | 1001100111101111… |
… | …01100101101101000 |
3 | 111022222020200002212 |
4 | 10303313230231220 |
5 | 41034243101001 |
6 | 2212312144252 |
7 | 241666346501 |
oct | 46367545550 |
9 | 14288220085 |
10 | 5165206376 |
11 | 2210696000 |
12 | 1001998088 |
13 | 644153045 |
14 | 36ddc7ba8 |
15 | 2036db7bb |
hex | 133decb68 |
5165206376 has 64 divisors (see below), whose sum is σ = 10880213760. Its totient is φ = 2297644800.
The previous prime is 5165206369. The next prime is 5165206379. The reversal of 5165206376 is 6736025615.
It is not an unprimeable number, because it can be changed into a prime (5165206379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 495296 + ... + 505616.
It is an arithmetic number, because the mean of its divisors is an integer number (170003340).
Almost surely, 25165206376 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 5165206376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5440106880).
5165206376 is an abundant number, since it is smaller than the sum of its proper divisors (5715007384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5165206376 is a wasteful number, since it uses less digits than its factorization.
5165206376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10407 (or 10381 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 41.
The square root of 5165206376 is about 71869.3702212563. The cubic root of 5165206376 is about 1728.6055092848.
The spelling of 5165206376 in words is "five billion, one hundred sixty-five million, two hundred six thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •