Base | Representation |
---|---|
bin | 10101100000111100… |
… | …001100111110011000 |
3 | 2012121222001010102011 |
4 | 111200330030332120 |
5 | 334302403343000 |
6 | 14340151315304 |
7 | 1445320136461 |
oct | 254074147630 |
9 | 65558033364 |
10 | 23101231000 |
11 | 9885051851 |
12 | 458867bb34 |
13 | 2242044073 |
14 | 119211dd68 |
15 | 9031592ba |
hex | 560f0cf98 |
23101231000 has 64 divisors (see below), whose sum is σ = 55800725760. Its totient is φ = 8942400000.
The previous prime is 23101230983. The next prime is 23101231003. The reversal of 23101231000 is 13210132.
It is a super-2 number, since 2×231012310002 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23101231003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 341601 + ... + 403600.
It is an arithmetic number, because the mean of its divisors is an integer number (871886340).
Almost surely, 223101231000 is an apocalyptic number.
23101231000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23101231000 is an abundant number, since it is smaller than the sum of its proper divisors (32699494760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23101231000 is a wasteful number, since it uses less digits than its factorization.
23101231000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 745253 (or 745239 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 23101231000 its reverse (13210132), we get a palindrome (23114441132).
The spelling of 23101231000 in words is "twenty-three billion, one hundred one million, two hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.462 sec. • engine limits •