Base | Representation |
---|---|
bin | 1001101100101110… |
… | …01001111100110001 |
3 | 111102212220100211001 |
4 | 10312113021330301 |
5 | 41130443211100 |
6 | 2220404122001 |
7 | 243014554333 |
oct | 46627117461 |
9 | 14385810731 |
10 | 5207007025 |
11 | 22322464a0 |
12 | 1013996301 |
13 | 64c9ca35c |
14 | 375789453 |
15 | 2071e6d6a |
hex | 1365c9f31 |
5207007025 has 24 divisors (see below), whose sum is σ = 7113437568. Its totient is φ = 3749400000.
The previous prime is 5207006983. The next prime is 5207007037.
5207007025 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5207007025 - 219 = 5206482737 is a prime.
It is a super-2 number, since 2×52070070252 = 54225844316798701250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5207006984 and 5207007002.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 65961 + ... + 121510.
It is an arithmetic number, because the mean of its divisors is an integer number (296393232).
Almost surely, 25207007025 is an apocalyptic number.
5207007025 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5207007025 is a deficient number, since it is larger than the sum of its proper divisors (1906430543).
5207007025 is a wasteful number, since it uses less digits than its factorization.
5207007025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187593 (or 187588 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 28.
The square root of 5207007025 is about 72159.5941299561. The cubic root of 5207007025 is about 1733.2560356514.
It can be divided in two parts, 520700 and 7025, that added together give a palindrome (527725).
The spelling of 5207007025 in words is "five billion, two hundred seven million, seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •