Base | Representation |
---|---|
bin | 11010110111000… |
… | …10010000110101 |
3 | 120200222112201122 |
4 | 31123202100311 |
5 | 430140301122 |
6 | 34205233325 |
7 | 5404130363 |
oct | 1533422065 |
9 | 520875648 |
10 | 225322037 |
11 | 106208866 |
12 | 63562845 |
13 | 378b1c65 |
14 | 21cd4633 |
15 | 14bac142 |
hex | d6e2435 |
225322037 has 2 divisors, whose sum is σ = 225322038. Its totient is φ = 225322036.
The previous prime is 225321997. The next prime is 225322051. The reversal of 225322037 is 730223522.
225322037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 168636196 + 56685841 = 12986^2 + 7529^2 .
It is a cyclic number.
It is not a de Polignac number, because 225322037 - 26 = 225321973 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 225321997 and 225322015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225321037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112661018 + 112661019.
It is an arithmetic number, because the mean of its divisors is an integer number (112661019).
Almost surely, 2225322037 is an apocalyptic number.
It is an amenable number.
225322037 is a deficient number, since it is larger than the sum of its proper divisors (1).
225322037 is an equidigital number, since it uses as much as digits as its factorization.
225322037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5040, while the sum is 26.
The square root of 225322037 is about 15010.7307283823. The cubic root of 225322037 is about 608.5102381276.
Adding to 225322037 its reverse (730223522), we get a palindrome (955545559).
The spelling of 225322037 in words is "two hundred twenty-five million, three hundred twenty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •