Base | Representation |
---|---|
bin | 1001100000110000… |
… | …11010111100001000 |
3 | 111011220002222210022 |
4 | 10300120122330020 |
5 | 40424302103324 |
6 | 2202421440012 |
7 | 240356011442 |
oct | 46030327410 |
9 | 14156088708 |
10 | 5106675464 |
11 | 2190648950 |
12 | ba6270008 |
13 | 634c9b977 |
14 | 36630d492 |
15 | 1ed4c905e |
hex | 13061af08 |
5106675464 has 64 divisors (see below), whose sum is σ = 11022480000. Its totient is φ = 2195269120.
The previous prime is 5106675389. The next prime is 5106675481. The reversal of 5106675464 is 4645766015.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 165962 + ... + 194310.
It is an arithmetic number, because the mean of its divisors is an integer number (172226250).
Almost surely, 25106675464 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 5106675464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5511240000).
5106675464 is an abundant number, since it is smaller than the sum of its proper divisors (5915804536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106675464 is a wasteful number, since it uses less digits than its factorization.
5106675464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28478 (or 28474 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 44.
The square root of 5106675464 is about 71461.0065980042. The cubic root of 5106675464 is about 1722.0513050804.
The spelling of 5106675464 in words is "five billion, one hundred six million, six hundred seventy-five thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •