Base | Representation |
---|---|
bin | 1001101110101001… |
… | …11011100111001001 |
3 | 111111000101010002020 |
4 | 10313110323213021 |
5 | 41144114414400 |
6 | 2222143155053 |
7 | 243302322624 |
oct | 46724734711 |
9 | 14430333066 |
10 | 5223201225 |
11 | 22403a7430 |
12 | 10192a5a89 |
13 | 65317a418 |
14 | 3779a2dbb |
15 | 2088452a0 |
hex | 13753b9c9 |
5223201225 has 24 divisors (see below), whose sum is σ = 9420757152. Its totient is φ = 2532460800.
The previous prime is 5223201211. The next prime is 5223201229. The reversal of 5223201225 is 5221023225.
It is not a de Polignac number, because 5223201225 - 26 = 5223201161 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5223201195 and 5223201204.
It is not an unprimeable number, because it can be changed into a prime (5223201229) 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 23 ways as a sum of consecutive naturals, for example, 3164752 + ... + 3166401.
It is an arithmetic number, because the mean of its divisors is an integer number (392531548).
Almost surely, 25223201225 is an apocalyptic number.
5223201225 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5223201225 is a deficient number, since it is larger than the sum of its proper divisors (4197555927).
5223201225 is a wasteful number, since it uses less digits than its factorization.
5223201225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6331177 (or 6331172 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 5223201225 is about 72271.7180161092. The cubic root of 5223201225 is about 1735.0510301219.
The spelling of 5223201225 in words is "five billion, two hundred twenty-three million, two hundred one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •