Base | Representation |
---|---|
bin | 1010100000101011100000… |
… | …00111011010001000010000 |
3 | 10000211120221200100120202010 |
4 | 11100111300013122020100 |
5 | 11012141112100310000 |
6 | 121054002255222520 |
7 | 4603603110345330 |
oct | 520256007321020 |
9 | 100746850316663 |
10 | 23113100010000 |
11 | 7401235442260 |
12 | 2713582517a40 |
13 | cb872c640280 |
14 | 59c973d350c0 |
15 | 2a135891dd50 |
hex | 1505701da210 |
23113100010000 has 1600 divisors, whose sum is σ = 100539505059840. Its totient is φ = 4417320960000.
The previous prime is 23113100009971. The next prime is 23113100010031. The reversal of 23113100010000 is 1000131132.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 9399388771 + ... + 9399391229.
Almost surely, 223113100010000 is an apocalyptic number.
23113100010000 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 23113100010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50269752529920).
23113100010000 is an abundant number, since it is smaller than the sum of its proper divisors (77426405049840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23113100010000 is a wasteful number, since it uses less digits than its factorization.
23113100010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2834 (or 2813 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 23113100010000 its reverse (1000131132), we get a palindrome (23114100141132).
The spelling of 23113100010000 in words is "twenty-three trillion, one hundred thirteen billion, one hundred million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •