Base | Representation |
---|---|
bin | 10101011011101000… |
… | …100111100100111000 |
3 | 2012101202112102221010 |
4 | 111123220213210320 |
5 | 334112111223000 |
6 | 14323251313520 |
7 | 1443156365112 |
oct | 253350474470 |
9 | 65352472833 |
10 | 23012211000 |
11 | 983987a7a9 |
12 | 45628ab8a0 |
13 | 22297761cc |
14 | 118438a3b2 |
15 | 8ea422d50 |
hex | 55ba27938 |
23012211000 has 256 divisors, whose sum is σ = 75823488000. Its totient is φ = 5794675200.
The previous prime is 23012210983. The next prime is 23012211011. The reversal of 23012211000 is 11221032.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27758586 + ... + 27759414.
It is an arithmetic number, because the mean of its divisors is an integer number (296185500).
Almost surely, 223012211000 is an apocalyptic number.
23012211000 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 23012211000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37911744000).
23012211000 is an abundant number, since it is smaller than the sum of its proper divisors (52811277000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23012211000 is a wasteful number, since it uses less digits than its factorization.
23012211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1359 (or 1345 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 23012211000 its reverse (11221032), we get a palindrome (23023432032).
The spelling of 23012211000 in words is "twenty-three billion, twelve million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •