Base | Representation |
---|---|
bin | 10101101101011101… |
… | …100100001010000100 |
3 | 2020011121022220102201 |
4 | 111231131210022010 |
5 | 340220143201200 |
6 | 14413054044244 |
7 | 1453450544245 |
oct | 255535441204 |
9 | 66147286381 |
10 | 23311303300 |
11 | 998269421a |
12 | 4626aa9684 |
13 | 2276716abc |
14 | 11b1da4ccc |
15 | 916802c6a |
hex | 56d764284 |
23311303300 has 144 divisors (see below), whose sum is σ = 54449640000. Its totient is φ = 8636474880.
The previous prime is 23311303289. The next prime is 23311303313. The reversal of 23311303300 is 330311332.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18967086 + ... + 18968314.
It is an arithmetic number, because the mean of its divisors is an integer number (378122500).
Almost surely, 223311303300 is an apocalyptic number.
23311303300 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 23311303300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27224820000).
23311303300 is an abundant number, since it is smaller than the sum of its proper divisors (31138336700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23311303300 is a wasteful number, since it uses less digits than its factorization.
23311303300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1478 (or 1471 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 23311303300 its reverse (330311332), we get a palindrome (23641614632).
The spelling of 23311303300 in words is "twenty-three billion, three hundred eleven million, three hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •