Base | Representation |
---|---|
bin | 1101111011110… |
… | …01100110100100 |
3 | 22010221121222000 |
4 | 12331321212210 |
5 | 214410440040 |
6 | 15333205300 |
7 | 2616356142 |
oct | 675714644 |
9 | 263847860 |
10 | 116890020 |
11 | 5aa88225 |
12 | 33190830 |
13 | 1b2a84c0 |
14 | 1174a592 |
15 | a3de130 |
hex | 6f799a4 |
116890020 has 96 divisors (see below), whose sum is σ = 391655040. Its totient is φ = 28771200.
The previous prime is 116890001. The next prime is 116890021. The reversal of 116890020 is 20098611.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (116890021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1306 + ... + 15345.
It is an arithmetic number, because the mean of its divisors is an integer number (4079740).
Almost surely, 2116890020 is an apocalyptic number.
116890020 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 116890020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195827520).
116890020 is an abundant number, since it is smaller than the sum of its proper divisors (274765020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116890020 is a wasteful number, since it uses less digits than its factorization.
116890020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16682 (or 16674 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The square root of 116890020 is about 10811.5688038323. The cubic root of 116890020 is about 488.9440261122.
The spelling of 116890020 in words is "one hundred sixteen million, eight hundred ninety thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •