Base | Representation |
---|---|
bin | 1101111010100… |
… | …01010011000010 |
3 | 22010122020111120 |
4 | 12331101103002 |
5 | 214340144210 |
6 | 15325453110 |
7 | 2615100630 |
oct | 675212302 |
9 | 263566446 |
10 | 116724930 |
11 | 5a985193 |
12 | 33111196 |
13 | 1b24b30a |
14 | 11706350 |
15 | a3aa270 |
hex | 6f514c2 |
116724930 has 64 divisors (see below), whose sum is σ = 322679808. Its totient is φ = 26470080.
The previous prime is 116724929. The next prime is 116724943. The reversal of 116724930 is 39427611.
It is a junction number, because it is equal to n+sod(n) for n = 116724891 and 116724900.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25389 + ... + 29631.
It is an arithmetic number, because the mean of its divisors is an integer number (5041872).
Almost surely, 2116724930 is an apocalyptic number.
116724930 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 116724930, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161339904).
116724930 is an abundant number, since it is smaller than the sum of its proper divisors (205954878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116724930 is a wasteful number, since it uses less digits than its factorization.
116724930 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4391.
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 116724930 is about 10803.9312289555. The cubic root of 116724930 is about 488.7137304299.
The spelling of 116724930 in words is "one hundred sixteen million, seven hundred twenty-four thousand, nine hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •