Base | Representation |
---|---|
bin | 1101110110101… |
… | …01000001110000 |
3 | 22002200101021100 |
4 | 12323111001300 |
5 | 214222402140 |
6 | 15310524400 |
7 | 2610550632 |
oct | 673250160 |
9 | 262611240 |
10 | 116215920 |
11 | 5a667817 |
12 | 32b06700 |
13 | 1b100722 |
14 | 11612a52 |
15 | a309530 |
hex | 6ed5070 |
116215920 has 60 divisors (see below), whose sum is σ = 390294216. Its totient is φ = 30990720.
The previous prime is 116215861. The next prime is 116215921. The reversal of 116215920 is 29512611.
116215920 is a `hidden beast` number, since 11 + 62 + 1 + 592 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×1162159202 = 27012280122892800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116215921) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 79986 + ... + 81425.
Almost surely, 2116215920 is an apocalyptic number.
116215920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116215920 is an abundant number, since it is smaller than the sum of its proper divisors (274078296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116215920 is a wasteful number, since it uses less digits than its factorization.
116215920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161430 (or 161421 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 116215920 is about 10780.3487884205. The cubic root of 116215920 is about 488.0023067167.
The spelling of 116215920 in words is "one hundred sixteen million, two hundred fifteen thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •