Base | Representation |
---|---|
bin | 1101001111101… |
… | …11001100101000 |
3 | 21202002010101022 |
4 | 12213313030220 |
5 | 211421104000 |
6 | 15005312012 |
7 | 2516305415 |
oct | 647671450 |
9 | 252063338 |
10 | 111113000 |
11 | 577a1929 |
12 | 31265608 |
13 | 1a034b4b |
14 | 10a8510c |
15 | 9b4c585 |
hex | 69f7328 |
111113000 has 64 divisors (see below), whose sum is σ = 271365120. Its totient is φ = 42504000.
The previous prime is 111112987. The next prime is 111113011. The reversal of 111113000 is 311111.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20585 + ... + 25415.
It is an arithmetic number, because the mean of its divisors is an integer number (4240080).
Almost surely, 2111113000 is an apocalyptic number.
111113000 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 111113000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135682560).
111113000 is an abundant number, since it is smaller than the sum of its proper divisors (160252120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111113000 is a wasteful number, since it uses less digits than its factorization.
111113000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4875 (or 4861 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 8.
The square root of 111113000 is about 10541.0151313808. The cubic root of 111113000 is about 480.7525810029.
Adding to 111113000 its reverse (311111), we get a palindrome (111424111).
The spelling of 111113000 in words is "one hundred eleven million, one hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •