Base | Representation |
---|---|
bin | 110100100111101010… |
… | …1101011010001000000 |
3 | 101210200011212112221210 |
4 | 1221033111223101000 |
5 | 3322411024411000 |
6 | 123524523050120 |
7 | 11110152060345 |
oct | 1511725532100 |
9 | 353604775853 |
10 | 113000232000 |
11 | 43a17759897 |
12 | 19a97670940 |
13 | a86ac62c06 |
14 | 567d84a7cc |
15 | 2e156d5350 |
hex | 1a4f56b440 |
113000232000 has 224 divisors, whose sum is σ = 373670803584. Its totient is φ = 30089472000.
The previous prime is 113000231983. The next prime is 113000232047. The reversal of 113000232000 is 232000311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 18548955 + ... + 18555045.
Almost surely, 2113000232000 is an apocalyptic number.
113000232000 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 113000232000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186835401792).
113000232000 is an abundant number, since it is smaller than the sum of its proper divisors (260670571584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113000232000 is an equidigital number, since it uses as much as digits as its factorization.
113000232000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6894 (or 6874 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 113000232000 its reverse (232000311), we get a palindrome (113232232311).
The spelling of 113000232000 in words is "one hundred thirteen billion, two hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •