Base | Representation |
---|---|
bin | 101100101100… |
… | …1001101010101 |
3 | 1122002120111111 |
4 | 1121121031111 |
5 | 21444342234 |
6 | 2154135021 |
7 | 403120621 |
oct | 131311525 |
9 | 48076444 |
10 | 23434069 |
11 | 122563aa |
12 | 7a21471 |
13 | 4b16519 |
14 | 3180181 |
15 | 20cd664 |
hex | 1659355 |
23434069 has 2 divisors, whose sum is σ = 23434070. Its totient is φ = 23434068.
The previous prime is 23434067. The next prime is 23434091. The reversal of 23434069 is 96043432.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15311569 + 8122500 = 3913^2 + 2850^2 .
It is a cyclic number.
It is not a de Polignac number, because 23434069 - 21 = 23434067 is a prime.
It is a super-2 number, since 2×234340692 = 1098311179793522, which contains 22 as substring.
Together with 23434067, it forms a pair of twin primes.
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 23434069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23434063) 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, 11717034 + 11717035.
It is an arithmetic number, because the mean of its divisors is an integer number (11717035).
Almost surely, 223434069 is an apocalyptic number.
It is an amenable number.
23434069 is a deficient number, since it is larger than the sum of its proper divisors (1).
23434069 is an equidigital number, since it uses as much as digits as its factorization.
23434069 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 23434069 is about 4840.8748176337. The cubic root of 23434069 is about 286.1645954606.
The spelling of 23434069 in words is "twenty-three million, four hundred thirty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •