Base | Representation |
---|---|
bin | 11010110100110… |
… | …00110011000101 |
3 | 120200102020221202 |
4 | 31122120303011 |
5 | 430101134000 |
6 | 34154552245 |
7 | 5401435160 |
oct | 1532306305 |
9 | 520366852 |
10 | 225021125 |
11 | 10602277a |
12 | 63438685 |
13 | 37807cc4 |
14 | 21c56ad7 |
15 | 14b4cdd5 |
hex | d698cc5 |
225021125 has 32 divisors (see below), whose sum is σ = 322632960. Its totient is φ = 153489600.
The previous prime is 225021109. The next prime is 225021143. The reversal of 225021125 is 521120522.
It is a happy number.
225021125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 225021125 - 24 = 225021109 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 225021097 and 225021106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 199814 + ... + 200936.
It is an arithmetic number, because the mean of its divisors is an integer number (10082280).
Almost surely, 2225021125 is an apocalyptic number.
225021125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
225021125 is a deficient number, since it is larger than the sum of its proper divisors (97611835).
225021125 is a wasteful number, since it uses less digits than its factorization.
225021125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1374 (or 1364 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 225021125 is about 15000.7041501391. The cubic root of 225021125 is about 608.2392340012.
Adding to 225021125 its reverse (521120522), we get a palindrome (746141647).
The spelling of 225021125 in words is "two hundred twenty-five million, twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •