Base | Representation |
---|---|
bin | 101101000011… |
… | …0101000010100 |
3 | 1122110000201010 |
4 | 1122012220110 |
5 | 22021320431 |
6 | 2202132220 |
7 | 404524212 |
oct | 132065024 |
9 | 48400633 |
10 | 23620116 |
11 | 12373163 |
12 | 7ab1070 |
13 | 4b80100 |
14 | 31cbcb2 |
15 | 2118846 |
hex | 1686a14 |
23620116 has 72 divisors (see below), whose sum is σ = 62922720. Its totient is φ = 6873984.
The previous prime is 23620111. The next prime is 23620117. The reversal of 23620116 is 61102632.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 23620092 and 23620101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23620111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38226 + ... + 38838.
Almost surely, 223620116 is an apocalyptic number.
23620116 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23620116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31461360).
23620116 is an abundant number, since it is smaller than the sum of its proper divisors (39302604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23620116 is a wasteful number, since it uses less digits than its factorization.
23620116 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 665 (or 650 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 23620116 is about 4860.0530861298. The cubic root of 23620116 is about 286.9199030248.
Adding to 23620116 its reverse (61102632), we get a palindrome (84722748).
The spelling of 23620116 in words is "twenty-three million, six hundred twenty thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •