Base | Representation |
---|---|
bin | 11010111001001… |
… | …01010001100001 |
3 | 120201111111020102 |
4 | 31130211101201 |
5 | 430223042023 |
6 | 34215152145 |
7 | 5406352532 |
oct | 1534452141 |
9 | 521444212 |
10 | 225596513 |
11 | 106385aaa |
12 | 63675655 |
13 | 37979b7c |
14 | 21d66689 |
15 | 14c13628 |
hex | d725461 |
225596513 has 2 divisors, whose sum is σ = 225596514. Its totient is φ = 225596512.
The previous prime is 225596491. The next prime is 225596531. The reversal of 225596513 is 315695522.
Together with next prime (225596531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 203005504 + 22591009 = 14248^2 + 4753^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-225596513 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (225596543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112798256 + 112798257.
It is an arithmetic number, because the mean of its divisors is an integer number (112798257).
Almost surely, 2225596513 is an apocalyptic number.
It is an amenable number.
225596513 is a deficient number, since it is larger than the sum of its proper divisors (1).
225596513 is an equidigital number, since it uses as much as digits as its factorization.
225596513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 81000, while the sum is 38.
The square root of 225596513 is about 15019.8706053015. The cubic root of 225596513 is about 608.7572234131.
Subtracting 225596513 from its reverse (315695522), we obtain a palindrome (90099009).
The spelling of 225596513 in words is "two hundred twenty-five million, five hundred ninety-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •