Base | Representation |
---|---|
bin | 11010110101011… |
… | …11000011101101 |
3 | 120200120220000122 |
4 | 31122233003231 |
5 | 430112043201 |
6 | 34200534325 |
7 | 5402265041 |
oct | 1532570355 |
9 | 520526018 |
10 | 225112301 |
11 | 106085227 |
12 | 634813a5 |
13 | 3783a65b |
14 | 21c7c021 |
15 | 14b69e1b |
hex | d6af0ed |
225112301 has 2 divisors, whose sum is σ = 225112302. Its totient is φ = 225112300.
The previous prime is 225112289. The next prime is 225112309. The reversal of 225112301 is 103211522.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199092100 + 26020201 = 14110^2 + 5101^2 .
It is a cyclic number.
It is not a de Polignac number, because 225112301 - 226 = 158003437 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 225112301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225112309) 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 as a sum of consecutive naturals, namely, 112556150 + 112556151.
It is an arithmetic number, because the mean of its divisors is an integer number (112556151).
Almost surely, 2225112301 is an apocalyptic number.
It is an amenable number.
225112301 is a deficient number, since it is larger than the sum of its proper divisors (1).
225112301 is an equidigital number, since it uses as much as digits as its factorization.
225112301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 225112301 is about 15003.7428996901. The cubic root of 225112301 is about 608.3213734477.
Adding to 225112301 its reverse (103211522), we get a palindrome (328323823).
The spelling of 225112301 in words is "two hundred twenty-five million, one hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •