Base | Representation |
---|---|
bin | 101100110101… |
… | …1100011100111 |
3 | 1122020101120222 |
4 | 1121223203213 |
5 | 22004243343 |
6 | 2155514555 |
7 | 403553003 |
oct | 131534347 |
9 | 48211528 |
10 | 23509223 |
11 | 122a7911 |
12 | 7a58a5b |
13 | 4b417aa |
14 | 319d703 |
15 | 20e5a68 |
hex | 166b8e7 |
23509223 has 4 divisors (see below), whose sum is σ = 23519280. Its totient is φ = 23499168.
The previous prime is 23509219. The next prime is 23509237. The reversal of 23509223 is 32290532.
It is a semiprime because it is the product of two primes, 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 23509223 - 22 = 23509219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23509192 and 23509201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23509273) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 518 + ... + 6876.
It is an arithmetic number, because the mean of its divisors is an integer number (5879820).
Almost surely, 223509223 is an apocalyptic number.
23509223 is a deficient number, since it is larger than the sum of its proper divisors (10057).
23509223 is an equidigital number, since it uses as much as digits as its factorization.
23509223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10056.
The product of its (nonzero) digits is 3240, while the sum is 26.
The square root of 23509223 is about 4848.6310439133. The cubic root of 23509223 is about 286.4701827978.
Adding to 23509223 its reverse (32290532), we get a palindrome (55799755).
It can be divided in two parts, 235092 and 23, that multiplied together give a triangular number (5407116 = T3288).
The spelling of 23509223 in words is "twenty-three million, five hundred nine thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •