Base | Representation |
---|---|
bin | 1101111011001… |
… | …11010100010111 |
3 | 22010210211020012 |
4 | 12331213110113 |
5 | 214401041002 |
6 | 15331430435 |
7 | 2615624612 |
oct | 675472427 |
9 | 263724205 |
10 | 116815127 |
11 | 5aa36a30 |
12 | 3315541b |
13 | 1b2803a0 |
14 | 1172b179 |
15 | a3c6d52 |
hex | 6f67517 |
116815127 has 16 divisors (see below), whose sum is σ = 139835808. Its totient is φ = 96170880.
The previous prime is 116815079. The next prime is 116815129. The reversal of 116815127 is 721518611.
It is not a de Polignac number, because 116815127 - 214 = 116798743 is a prime.
It is a super-2 number, since 2×1168151272 = 27291547792052258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116815093 and 116815102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116815129) 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 15 ways as a sum of consecutive naturals, for example, 128 + ... + 15285.
It is an arithmetic number, because the mean of its divisors is an integer number (8739738).
Almost surely, 2116815127 is an apocalyptic number.
116815127 is a deficient number, since it is larger than the sum of its proper divisors (23020681).
116815127 is a wasteful number, since it uses less digits than its factorization.
116815127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15490.
The product of its digits is 3360, while the sum is 32.
The square root of 116815127 is about 10808.1046904626. The cubic root of 116815127 is about 488.8395794755.
The spelling of 116815127 in words is "one hundred sixteen million, eight hundred fifteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •