Base | Representation |
---|---|
bin | 1001101110101100… |
… | …00100100011111001 |
3 | 111111000221021221220 |
4 | 10313112010203321 |
5 | 41144204000100 |
6 | 2222153422253 |
7 | 243305006022 |
oct | 46726044371 |
9 | 14430837856 |
10 | 5223500025 |
11 | 2240590977 |
12 | 101940a989 |
13 | 653253423 |
14 | 377a3dc49 |
15 | 2088a3aa0 |
hex | 1375848f9 |
5223500025 has 24 divisors (see below), whose sum is σ = 8638342944. Its totient is φ = 2785171200.
The previous prime is 5223500021. The next prime is 5223500027. The reversal of 5223500025 is 5200053225.
It is not a de Polignac number, because 5223500025 - 22 = 5223500021 is a prime.
It is a super-2 number, since 2×52235000252 = 54569905022350001250, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5223499968 and 5223500004.
It is not an unprimeable number, because it can be changed into a prime (5223500021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 463710 + ... + 474840.
It is an arithmetic number, because the mean of its divisors is an integer number (359930956).
Almost surely, 25223500025 is an apocalyptic number.
It is an amenable number.
5223500025 is a deficient number, since it is larger than the sum of its proper divisors (3414842919).
5223500025 is a wasteful number, since it uses less digits than its factorization.
5223500025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17401 (or 17396 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 24.
The square root of 5223500025 is about 72273.7851852247. The cubic root of 5223500025 is about 1735.0841147724.
The spelling of 5223500025 in words is "five billion, two hundred twenty-three million, five hundred thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •