Base | Representation |
---|---|
bin | 1101111100010… |
… | …00100011010011 |
3 | 22011001201221211 |
4 | 12332020203103 |
5 | 214414420001 |
6 | 15334400551 |
7 | 2620032514 |
oct | 676104323 |
9 | 264051854 |
10 | 116951251 |
11 | 6001a22a |
12 | 33200157 |
13 | 1b2ca331 |
14 | 11764a0b |
15 | a402351 |
hex | 6f888d3 |
116951251 has 32 divisors (see below), whose sum is σ = 135475200. Its totient is φ = 100362240.
The previous prime is 116951221. The next prime is 116951257. The reversal of 116951251 is 152159611.
116951251 = T178 + T179 + ... + T890.
It is a cyclic number.
It is not a de Polignac number, because 116951251 - 27 = 116951123 is a prime.
It is a super-2 number, since 2×1169512512 = 27355190220930002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116951257) 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, 1205635 + ... + 1205731.
It is an arithmetic number, because the mean of its divisors is an integer number (4233600).
Almost surely, 2116951251 is an apocalyptic number.
116951251 is a deficient number, since it is larger than the sum of its proper divisors (18523949).
116951251 is a wasteful number, since it uses less digits than its factorization.
116951251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259.
The product of its digits is 2700, while the sum is 31.
The square root of 116951251 is about 10814.4001682941. The cubic root of 116951251 is about 489.0293864238.
The spelling of 116951251 in words is "one hundred sixteen million, nine hundred fifty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •