Base | Representation |
---|---|
bin | 1101111010001… |
… | …01011010101111 |
3 | 22010112202202101 |
4 | 12331011122233 |
5 | 214332120041 |
6 | 15324435531 |
7 | 2614506025 |
oct | 675053257 |
9 | 263482671 |
10 | 116676271 |
11 | 5a951678 |
12 | 330a8ba7 |
13 | 1b23211a |
14 | 116d2715 |
15 | a39ab31 |
hex | 6f456af |
116676271 has 8 divisors (see below), whose sum is σ = 117477360. Its totient is φ = 115878528.
The previous prime is 116676269. The next prime is 116676289. The reversal of 116676271 is 172676611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116676271 - 21 = 116676269 is a prime.
It is a super-2 number, since 2×1166762712 = 27226704428930882, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116676271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116676671) 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 7 ways as a sum of consecutive naturals, for example, 118935 + ... + 119911.
It is an arithmetic number, because the mean of its divisors is an integer number (14684670).
Almost surely, 2116676271 is an apocalyptic number.
116676271 is a deficient number, since it is larger than the sum of its proper divisors (801089).
116676271 is an equidigital number, since it uses as much as digits as its factorization.
116676271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1673.
The product of its digits is 21168, while the sum is 37.
The square root of 116676271 is about 10801.6790824390. The cubic root of 116676271 is about 488.6458111300.
The spelling of 116676271 in words is "one hundred sixteen million, six hundred seventy-six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •