Base | Representation |
---|---|
bin | 101011111101… |
… | …0111010110100 |
3 | 1121100221201110 |
4 | 1113322322310 |
5 | 21400012420 |
6 | 2141555020 |
7 | 366621633 |
oct | 127727264 |
9 | 47327643 |
10 | 23047860 |
11 | 12012220 |
12 | 7875a70 |
13 | 4a0c7b4 |
14 | 30bd51a |
15 | 2053ee0 |
hex | 15faeb4 |
23047860 has 96 divisors (see below), whose sum is σ = 71995392. Its totient is φ = 5461120.
The previous prime is 23047859. The next prime is 23047873. The reversal of 23047860 is 6874032.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30649 + ... + 31391.
It is an arithmetic number, because the mean of its divisors is an integer number (749952).
Almost surely, 223047860 is an apocalyptic number.
23047860 is a gapful number since it is divisible by the number (20) 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 23047860, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35997696).
23047860 is an abundant number, since it is smaller than the sum of its proper divisors (48947532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23047860 is a wasteful number, since it uses less digits than its factorization.
23047860 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 813 (or 811 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 23047860 is about 4800.8186801836. The cubic root of 23047860 is about 284.5838185291.
Subtracting from 23047860 its reverse (6874032), we obtain a triangular number (16173828 = T5687).
The spelling of 23047860 in words is "twenty-three million, forty-seven thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •