Base | Representation |
---|---|
bin | 101100110000… |
… | …1101110101001 |
3 | 1122011100101002 |
4 | 1121201232221 |
5 | 22002001334 |
6 | 2155004345 |
7 | 403324436 |
oct | 131415651 |
9 | 48140332 |
10 | 23468969 |
11 | 1227a647 |
12 | 7a396b5 |
13 | 4b29384 |
14 | 318cb8d |
15 | 20d8b7e |
hex | 1661ba9 |
23468969 has 4 divisors (see below), whose sum is σ = 23479440. Its totient is φ = 23458500.
The previous prime is 23468923. The next prime is 23468981. The reversal of 23468969 is 96986432.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 23468969 - 212 = 23464873 is a prime.
It is a super-2 number, since 2×234689692 = 1101585011845922, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23468909) 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 in 3 ways as a sum of consecutive naturals, for example, 359 + ... + 6860.
It is an arithmetic number, because the mean of its divisors is an integer number (5869860).
Almost surely, 223468969 is an apocalyptic number.
It is an amenable number.
23468969 is a deficient number, since it is larger than the sum of its proper divisors (10471).
23468969 is an equidigital number, since it uses as much as digits as its factorization.
23468969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10470.
The product of its digits is 559872, while the sum is 47.
The square root of 23468969 is about 4844.4781968753. The cubic root of 23468969 is about 286.3065851791.
The spelling of 23468969 in words is "twenty-three million, four hundred sixty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •