Base | Representation |
---|---|
bin | 11011010010001… |
… | …01010000110101 |
3 | 120221122222002202 |
4 | 31221011100311 |
5 | 432042421034 |
6 | 34413314245 |
7 | 5446251002 |
oct | 1551052065 |
9 | 527588082 |
10 | 228873269 |
11 | 108213969 |
12 | 64795985 |
13 | 38556491 |
14 | 2257a8a9 |
15 | 1515e47e |
hex | da45435 |
228873269 has 2 divisors, whose sum is σ = 228873270. Its totient is φ = 228873268.
The previous prime is 228873241. The next prime is 228873289. The reversal of 228873269 is 962378822.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182115025 + 46758244 = 13495^2 + 6838^2 .
It is a cyclic number.
It is not a de Polignac number, because 228873269 - 220 = 227824693 is a prime.
It is a super-2 number, since 2×2288732692 = 104765946525492722, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (228873209) 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, 114436634 + 114436635.
It is an arithmetic number, because the mean of its divisors is an integer number (114436635).
Almost surely, 2228873269 is an apocalyptic number.
It is an amenable number.
228873269 is a deficient number, since it is larger than the sum of its proper divisors (1).
228873269 is an equidigital number, since it uses as much as digits as its factorization.
228873269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 580608, while the sum is 47.
The square root of 228873269 is about 15128.5580608332. The cubic root of 228873269 is about 611.6904369822.
It can be divided in two parts, 2288 and 73269, that added together give a palindrome (75557).
The spelling of 228873269 in words is "two hundred twenty-eight million, eight hundred seventy-three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •