Base | Representation |
---|---|
bin | 101100000101… |
… | …0001000111000 |
3 | 1121111010020100 |
4 | 1120022020320 |
5 | 21404011300 |
6 | 2143155400 |
7 | 400301451 |
oct | 130121070 |
9 | 47433210 |
10 | 23110200 |
11 | 12055043 |
12 | 78a5b60 |
13 | 4a31c99 |
14 | 30d8128 |
15 | 2067700 |
hex | 160a238 |
23110200 has 144 divisors (see below), whose sum is σ = 79939080. Its totient is φ = 5978880.
The previous prime is 23110177. The next prime is 23110201. The reversal of 23110200 is 201132.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23110201) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 66427 + ... + 66773.
Almost surely, 223110200 is an apocalyptic number.
23110200 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 23110200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39969540).
23110200 is an abundant number, since it is smaller than the sum of its proper divisors (56828880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23110200 is a wasteful number, since it uses less digits than its factorization.
23110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406 (or 394 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 23110200 is about 4807.3069384012. The cubic root of 23110200 is about 284.8401689229.
Adding to 23110200 its reverse (201132), we get a palindrome (23311332).
The spelling of 23110200 in words is "twenty-three million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •