Base | Representation |
---|---|
bin | 11011101011110… |
… | …01110001010101 |
3 | 121011222201020211 |
4 | 31311321301111 |
5 | 433422442234 |
6 | 35013325421 |
7 | 5516646154 |
oct | 1565716125 |
9 | 534881224 |
10 | 232234069 |
11 | 10a0a9991 |
12 | 65936871 |
13 | 39162112 |
14 | 22bb359b |
15 | 155c5164 |
hex | dd79c55 |
232234069 has 2 divisors, whose sum is σ = 232234070. Its totient is φ = 232234068.
The previous prime is 232234039. The next prime is 232234091. The reversal of 232234069 is 960432232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 223143844 + 9090225 = 14938^2 + 3015^2 .
It is a cyclic number.
It is not a de Polignac number, because 232234069 - 29 = 232233557 is a prime.
It is a super-2 number, since 2×2322340692 = 107865325608593522, 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 232234069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232234039) 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, 116117034 + 116117035.
It is an arithmetic number, because the mean of its divisors is an integer number (116117035).
Almost surely, 2232234069 is an apocalyptic number.
It is an amenable number.
232234069 is a deficient number, since it is larger than the sum of its proper divisors (1).
232234069 is an equidigital number, since it uses as much as digits as its factorization.
232234069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 31.
The square root of 232234069 is about 15239.2279660093. The cubic root of 232234069 is about 614.6699434169.
The spelling of 232234069 in words is "two hundred thirty-two million, two hundred thirty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •