Base | Representation |
---|---|
bin | 11010110100111… |
… | …11100011001101 |
3 | 120200110122220001 |
4 | 31122133203031 |
5 | 430103030111 |
6 | 34155324301 |
7 | 5401611616 |
oct | 1532374315 |
9 | 520418801 |
10 | 225048781 |
11 | 106041531 |
12 | 63450691 |
13 | 37817779 |
14 | 21c62c0d |
15 | 14b561c1 |
hex | d69f8cd |
225048781 has 2 divisors, whose sum is σ = 225048782. Its totient is φ = 225048780.
The previous prime is 225048757. The next prime is 225048829. The reversal of 225048781 is 187840522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 186186025 + 38862756 = 13645^2 + 6234^2 .
It is a cyclic number.
It is not a de Polignac number, because 225048781 - 213 = 225040589 is a prime.
It is a super-2 number, since 2×2250487812 = 101293907659171922, which contains 22 as substring.
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 225048781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225048731) 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, 112524390 + 112524391.
It is an arithmetic number, because the mean of its divisors is an integer number (112524391).
Almost surely, 2225048781 is an apocalyptic number.
It is an amenable number.
225048781 is a deficient number, since it is larger than the sum of its proper divisors (1).
225048781 is an equidigital number, since it uses as much as digits as its factorization.
225048781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35840, while the sum is 37.
The square root of 225048781 is about 15001.6259452101. The cubic root of 225048781 is about 608.2641513287.
The spelling of 225048781 in words is "two hundred twenty-five million, forty-eight thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •