Base | Representation |
---|---|
bin | 10101100001011110… |
… | …000010100100110100 |
3 | 2012122120201210011210 |
4 | 111201132002210310 |
5 | 334312141220200 |
6 | 14341105401420 |
7 | 1445455422426 |
oct | 254136024464 |
9 | 65576653153 |
10 | 23110101300 |
11 | 988a060180 |
12 | 458b639270 |
13 | 2243b2b670 |
14 | 119338c816 |
15 | 903d0c650 |
hex | 561782934 |
23110101300 has 144 divisors (see below), whose sum is σ = 78555097152. Its totient is φ = 5171481600.
The previous prime is 23110101293. The next prime is 23110101307. The reversal of 23110101300 is 310101132.
It is an interprime number because it is at equal distance from previous prime (23110101293) and next prime (23110101307).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23110101307) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 226449 + ... + 312248.
It is an arithmetic number, because the mean of its divisors is an integer number (545521508).
Almost surely, 223110101300 is an apocalyptic number.
23110101300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23110101300 is an abundant number, since it is smaller than the sum of its proper divisors (55444995852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23110101300 is a wasteful number, since it uses less digits than its factorization.
23110101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538738 (or 538731 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 23110101300 its reverse (310101132), we get a palindrome (23420202432).
The spelling of 23110101300 in words is "twenty-three billion, one hundred ten million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •