Base | Representation |
---|---|
bin | 1001111010001101… |
… | …01101001100000001 |
3 | 111201202202212210210 |
4 | 10331012231030001 |
5 | 41343423313200 |
6 | 2235524544333 |
7 | 245560255623 |
oct | 47506551401 |
9 | 14652685723 |
10 | 5320135425 |
11 | 2290094540 |
12 | 10458520a9 |
13 | 66a289637 |
14 | 3867d6c13 |
15 | 2120e1650 |
hex | 13d1ad301 |
5320135425 has 48 divisors (see below), whose sum is σ = 9611384832. Its totient is φ = 2575214400.
The previous prime is 5320135423. The next prime is 5320135427. The reversal of 5320135425 is 5245310235.
It is an interprime number because it is at equal distance from previous prime (5320135423) and next prime (5320135427).
It is not a de Polignac number, because 5320135425 - 21 = 5320135423 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5320135392 and 5320135401.
It is not an unprimeable number, because it can be changed into a prime (5320135421) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 528792 + ... + 538758.
It is an arithmetic number, because the mean of its divisors is an integer number (200237184).
Almost surely, 25320135425 is an apocalyptic number.
5320135425 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5320135425 is a deficient number, since it is larger than the sum of its proper divisors (4291249407).
5320135425 is a wasteful number, since it uses less digits than its factorization.
5320135425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10638 (or 10633 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 5320135425 is about 72939.2584620930. The cubic root of 5320135425 is about 1745.7185596891.
The spelling of 5320135425 in words is "five billion, three hundred twenty million, one hundred thirty-five thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •