Base | Representation |
---|---|
bin | 11011010000000… |
… | …11111011111101 |
3 | 120221011101001112 |
4 | 31220003323331 |
5 | 432010340233 |
6 | 34403451405 |
7 | 5444054621 |
oct | 1550037375 |
9 | 527141045 |
10 | 228605693 |
11 | 108050928 |
12 | 64686b65 |
13 | 38491754 |
14 | 2250b181 |
15 | 1510a048 |
hex | da03efd |
228605693 has 2 divisors, whose sum is σ = 228605694. Its totient is φ = 228605692.
The previous prime is 228605639. The next prime is 228605731. The reversal of 228605693 is 396506822.
Together with previous prime (228605639) 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., 225060004 + 3545689 = 15002^2 + 1883^2 .
It is a cyclic number.
It is not a de Polignac number, because 228605693 - 210 = 228604669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 228605693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (228205693) 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, 114302846 + 114302847.
It is an arithmetic number, because the mean of its divisors is an integer number (114302847).
Almost surely, 2228605693 is an apocalyptic number.
It is an amenable number.
228605693 is a deficient number, since it is larger than the sum of its proper divisors (1).
228605693 is an equidigital number, since it uses as much as digits as its factorization.
228605693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 41.
The square root of 228605693 is about 15119.7120673642. The cubic root of 228605693 is about 611.4519680306.
The spelling of 228605693 in words is "two hundred twenty-eight million, six hundred five thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •