Base | Representation |
---|---|
bin | 1001100000100110… |
… | …01110110111111101 |
3 | 111011210112220000210 |
4 | 10300103032313331 |
5 | 40423430042300 |
6 | 2202332343033 |
7 | 240341315145 |
oct | 46023166775 |
9 | 14153486023 |
10 | 5105315325 |
11 | 218a8a9a70 |
12 | ba5914a79 |
13 | 634913856 |
14 | 366077925 |
15 | 1ed30b050 |
hex | 1304cedfd |
5105315325 has 48 divisors (see below), whose sum is σ = 9216856512. Its totient is φ = 2472960000.
The previous prime is 5105315317. The next prime is 5105315329. The reversal of 5105315325 is 5235135015.
It is not a de Polignac number, because 5105315325 - 23 = 5105315317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5105315292 and 5105315301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105315329) 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 47 ways as a sum of consecutive naturals, for example, 1137085 + ... + 1141565.
It is an arithmetic number, because the mean of its divisors is an integer number (192017844).
Almost surely, 25105315325 is an apocalyptic number.
5105315325 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5105315325 is a deficient number, since it is larger than the sum of its proper divisors (4111541187).
5105315325 is a wasteful number, since it uses less digits than its factorization.
5105315325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5886 (or 5881 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
The square root of 5105315325 is about 71451.4893126798. The cubic root of 5105315325 is about 1721.8984047486.
The spelling of 5105315325 in words is "five billion, one hundred five million, three hundred fifteen thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •