Base | Representation |
---|---|
bin | 101101001011… |
… | …1100110101000 |
3 | 1122120120002002 |
4 | 1122113212220 |
5 | 22031032030 |
6 | 2203430132 |
7 | 405234002 |
oct | 132274650 |
9 | 48516062 |
10 | 23689640 |
11 | 12410417 |
12 | 7b25348 |
13 | 4ba5950 |
14 | 3209372 |
15 | 212e245 |
hex | 16979a8 |
23689640 has 32 divisors (see below), whose sum is σ = 57403080. Its totient is φ = 8746752.
The previous prime is 23689639. The next prime is 23689643. The reversal of 23689640 is 4698632.
It can be written as a sum of positive squares in 4 ways, for example, as 13942756 + 9746884 = 3734^2 + 3122^2 .
It is a super-2 number, since 2×236896402 = 1122398086659200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23689594 and 23689603.
It is not an unprimeable number, because it can be changed into a prime (23689643) 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 7 ways as a sum of consecutive naturals, for example, 22259 + ... + 23298.
Almost surely, 223689640 is an apocalyptic number.
23689640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23689640 is an abundant number, since it is smaller than the sum of its proper divisors (33713440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23689640 is a wasteful number, since it uses less digits than its factorization.
23689640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45581 (or 45577 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 38.
The square root of 23689640 is about 4867.2004273504. The cubic root of 23689640 is about 287.2011361857.
The spelling of 23689640 in words is "twenty-three million, six hundred eighty-nine thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •