Base | Representation |
---|---|
bin | 101100101001… |
… | …0111101001111 |
3 | 1122001021101010 |
4 | 1121102331033 |
5 | 21443032323 |
6 | 2153420303 |
7 | 402653151 |
oct | 131227517 |
9 | 48037333 |
10 | 23408463 |
11 | 12239141 |
12 | 7a0a693 |
13 | 4b07980 |
14 | 3174ad1 |
15 | 20c5c93 |
hex | 1652f4f |
23408463 has 8 divisors (see below), whose sum is σ = 33612208. Its totient is φ = 14405184.
The previous prime is 23408461. The next prime is 23408471. The reversal of 23408463 is 36480432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23408463 - 21 = 23408461 is a prime.
It is a super-2 number, since 2×234084632 = 1095912280044738, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23408463.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23408461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 300070 + ... + 300147.
It is an arithmetic number, because the mean of its divisors is an integer number (4201526).
Almost surely, 223408463 is an apocalyptic number.
23408463 is a deficient number, since it is larger than the sum of its proper divisors (10203745).
23408463 is a wasteful number, since it uses less digits than its factorization.
23408463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600233.
The product of its (nonzero) digits is 13824, while the sum is 30.
The square root of 23408463 is about 4838.2293248667. The cubic root of 23408463 is about 286.0603284475.
Adding to 23408463 its reverse (36480432), we get a palindrome (59888895).
It can be divided in two parts, 23408 and 463, that added together give a triangular number (23871 = T218).
The spelling of 23408463 in words is "twenty-three million, four hundred eight thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •