Base | Representation |
---|---|
bin | 110100100111101010… |
… | …1100110001000111000 |
3 | 101210200011211111011000 |
4 | 1221033111212020320 |
5 | 3322411023223000 |
6 | 123524522405000 |
7 | 11110151642205 |
oct | 1511725461070 |
9 | 353604744130 |
10 | 113000211000 |
11 | 43a17745036 |
12 | 19a97660760 |
13 | a86ac564a1 |
14 | 567d842cac |
15 | 2e156ce000 |
hex | 1a4f566238 |
113000211000 has 512 divisors, whose sum is σ = 407485728000. Its totient is φ = 28933632000.
The previous prime is 113000210993. The next prime is 113000211001. The reversal of 113000211000 is 112000311.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113000211001) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 216890740 + ... + 216891260.
Almost surely, 2113000211000 is an apocalyptic number.
113000211000 is a gapful number since it is divisible by the number (10) 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 113000211000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203742864000).
113000211000 is an abundant number, since it is smaller than the sum of its proper divisors (294485517000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113000211000 is a wasteful number, since it uses less digits than its factorization.
113000211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 857 (or 837 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 113000211000 its reverse (112000311), we get a palindrome (113112211311).
The spelling of 113000211000 in words is "one hundred thirteen billion, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •