Base | Representation |
---|---|
bin | 101101001110… |
… | …0000101110110 |
3 | 1122121111021220 |
4 | 1122130011312 |
5 | 22032124042 |
6 | 2204051210 |
7 | 405341412 |
oct | 132340566 |
9 | 48544256 |
10 | 23708022 |
11 | 12423208 |
12 | 7b33b06 |
13 | 4bb1120 |
14 | 3211d42 |
15 | 21348ec |
hex | 169c176 |
23708022 has 64 divisors (see below), whose sum is σ = 54190080. Its totient is φ = 6862464.
The previous prime is 23708011. The next prime is 23708023. The reversal of 23708022 is 22080732.
It is a junction number, because it is equal to n+sod(n) for n = 23707983 and 23708001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23708023) 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 31 ways as a sum of consecutive naturals, for example, 106203 + ... + 106425.
It is an arithmetic number, because the mean of its divisors is an integer number (846720).
Almost surely, 223708022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23708022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27095040).
23708022 is an abundant number, since it is smaller than the sum of its proper divisors (30482058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23708022 is a wasteful number, since it uses less digits than its factorization.
23708022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317.
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 23708022 is about 4869.0884157099. The cubic root of 23708022 is about 287.2754016505.
Adding to 23708022 its reverse (22080732), we get a palindrome (45788754).
The spelling of 23708022 in words is "twenty-three million, seven hundred eight thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •