Base | Representation |
---|---|
bin | 11011010101111… |
… | …10011001011001 |
3 | 120222121011201012 |
4 | 31222332121121 |
5 | 432204310213 |
6 | 34432103305 |
7 | 5453415356 |
oct | 1552763131 |
9 | 528534635 |
10 | 229369433 |
11 | 108522717 |
12 | 64994b35 |
13 | 3869b277 |
14 | 2266962d |
15 | 1520b4a8 |
hex | dabe659 |
229369433 has 2 divisors, whose sum is σ = 229369434. Its totient is φ = 229369432.
The previous prime is 229369397. The next prime is 229369451. The reversal of 229369433 is 334963922.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215590489 + 13778944 = 14683^2 + 3712^2 .
It is a cyclic number.
It is not a de Polignac number, because 229369433 - 26 = 229369369 is a prime.
It is a super-2 number, since 2×2293694332 = 105220673589482978, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (229369633) 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, 114684716 + 114684717.
It is an arithmetic number, because the mean of its divisors is an integer number (114684717).
Almost surely, 2229369433 is an apocalyptic number.
It is an amenable number.
229369433 is a deficient number, since it is larger than the sum of its proper divisors (1).
229369433 is an equidigital number, since it uses as much as digits as its factorization.
229369433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 209952, while the sum is 41.
The square root of 229369433 is about 15144.9474413086. The cubic root of 229369433 is about 612.1321366257.
The spelling of 229369433 in words is "two hundred twenty-nine million, three hundred sixty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •