Base | Representation |
---|---|
bin | 1101110101001… |
… | …01101111101001 |
3 | 22002022112121100 |
4 | 12322211233221 |
5 | 214200202444 |
6 | 15302432013 |
7 | 2606113200 |
oct | 672455751 |
9 | 262275540 |
10 | 116022249 |
11 | 5a545262 |
12 | 32a32609 |
13 | 1b063525 |
14 | 115a2237 |
15 | a2bbe69 |
hex | 6ea5be9 |
116022249 has 18 divisors (see below), whose sum is σ = 194949690. Its totient is φ = 66298176.
The previous prime is 116022241. The next prime is 116022271. The reversal of 116022249 is 942220611.
116022249 is a `hidden beast` number, since 11 + 602 + 2 + 2 + 49 = 666.
It can be written as a sum of positive squares in only one way, i.e., 106750224 + 9272025 = 10332^2 + 3045^2 .
It is not a de Polignac number, because 116022249 - 23 = 116022241 is a prime.
It is a super-2 number, since 2×1160222492 = 26922324526036002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (116022241) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 131104 + ... + 131985.
Almost surely, 2116022249 is an apocalyptic number.
It is an amenable number.
116022249 is a deficient number, since it is larger than the sum of its proper divisors (78927441).
116022249 is a wasteful number, since it uses less digits than its factorization.
116022249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263109 (or 263099 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 116022249 is about 10771.3624486413. The cubic root of 116022249 is about 487.7310746744.
It can be divided in two parts, 1160 and 22249, that added together give a square (23409 = 1532).
The spelling of 116022249 in words is "one hundred sixteen million, twenty-two thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •