Base | Representation |
---|---|
bin | 101100101111… |
… | …1101100100001 |
3 | 1122010220221122 |
4 | 1121133230201 |
5 | 22001220031 |
6 | 2154502025 |
7 | 403261241 |
oct | 131375441 |
9 | 48126848 |
10 | 23460641 |
11 | 12274366 |
12 | 7a34915 |
13 | 4b25649 |
14 | 3189b21 |
15 | 20d647b |
hex | 165fb21 |
23460641 has 2 divisors, whose sum is σ = 23460642. Its totient is φ = 23460640.
The previous prime is 23460637. The next prime is 23460643. The reversal of 23460641 is 14606432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21715600 + 1745041 = 4660^2 + 1321^2 .
It is a cyclic number.
It is not a de Polignac number, because 23460641 - 22 = 23460637 is a prime.
It is a super-2 number, since 2×234606412 = 1100803352261762, which contains 22 as substring.
Together with 23460643, 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 23460641.
It is not a weakly prime, because it can be changed into another prime (23460643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11730320 + 11730321.
It is an arithmetic number, because the mean of its divisors is an integer number (11730321).
Almost surely, 223460641 is an apocalyptic number.
It is an amenable number.
23460641 is a deficient number, since it is larger than the sum of its proper divisors (1).
23460641 is an equidigital number, since it uses as much as digits as its factorization.
23460641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
The square root of 23460641 is about 4843.6185853141. The cubic root of 23460641 is about 286.2727157275.
It can be divided in two parts, 2 and 3460641, that added together give a palindrome (3460643).
The spelling of 23460641 in words is "twenty-three million, four hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •