Base | Representation |
---|---|
bin | 1001100000101100… |
… | …00110100100001101 |
3 | 111011211222010010110 |
4 | 10300112012210031 |
5 | 40424123131400 |
6 | 2202400430233 |
7 | 240350600553 |
oct | 46026064415 |
9 | 14154863113 |
10 | 5106067725 |
11 | 2190273290 |
12 | ba6018379 |
13 | 634b18165 |
14 | 3661d1bd3 |
15 | 1ed408e50 |
hex | 13058690d |
5106067725 has 48 divisors (see below), whose sum is σ = 9751250880. Its totient is φ = 2330035200.
The previous prime is 5106067721. The next prime is 5106067727. The reversal of 5106067725 is 5277606015.
It is not a de Polignac number, because 5106067725 - 22 = 5106067721 is a prime.
It is a super-2 number, since 2×51060677252 = 52143855224573351250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5106067721) 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 47 ways as a sum of consecutive naturals, for example, 168010 + ... + 196059.
It is an arithmetic number, because the mean of its divisors is an integer number (203151060).
Almost surely, 25106067725 is an apocalyptic number.
5106067725 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5106067725 is a deficient number, since it is larger than the sum of its proper divisors (4645183155).
5106067725 is a wasteful number, since it uses less digits than its factorization.
5106067725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364110 (or 364105 counting only the distinct ones).
The product of its (nonzero) digits is 88200, while the sum is 39.
The square root of 5106067725 is about 71456.7542293939. The cubic root of 5106067725 is about 1721.9829893196.
The spelling of 5106067725 in words is "five billion, one hundred six million, sixty-seven thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •