Base | Representation |
---|---|
bin | 1001100000110000… |
… | …01100010011011100 |
3 | 111011212222221120000 |
4 | 10300120030103130 |
5 | 40424243144031 |
6 | 2202420254300 |
7 | 240355341612 |
oct | 46030142334 |
9 | 14155887500 |
10 | 5106615516 |
11 | 2190607902 |
12 | ba6241390 |
13 | 634c7a5b2 |
14 | 3662d56b2 |
15 | 1ed4b63e6 |
hex | 13060c4dc |
5106615516 has 120 divisors (see below), whose sum is σ = 14197319136. Its totient is φ = 1595013120.
The previous prime is 5106615511. The next prime is 5106615551. The reversal of 5106615516 is 6155166015.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5106615511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1325505 + ... + 1329351.
Almost surely, 25106615516 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 5106615516, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7098659568).
5106615516 is an abundant number, since it is smaller than the sum of its proper divisors (9090703620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106615516 is a wasteful number, since it uses less digits than its factorization.
5106615516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4121 (or 4110 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The square root of 5106615516 is about 71460.5871512402. The cubic root of 5106615516 is about 1722.0445665844.
The spelling of 5106615516 in words is "five billion, one hundred six million, six hundred fifteen thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •