Base | Representation |
---|---|
bin | 1101110111001… |
… | …00000110001001 |
3 | 22002210111221022 |
4 | 12323210012021 |
5 | 214231341031 |
6 | 15312122225 |
7 | 2611225604 |
oct | 673440611 |
9 | 262714838 |
10 | 116277641 |
11 | 5a6aa127 |
12 | 32b36375 |
13 | 1b12284c |
14 | 1162b33b |
15 | a31c97b |
hex | 6ee4189 |
116277641 has 4 divisors (see below), whose sum is σ = 116322432. Its totient is φ = 116232852.
The previous prime is 116277631. The next prime is 116277647. The reversal of 116277641 is 146772611.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 146772611 = 17 ⋅8633683.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116277641 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (116277647) 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 3 ways as a sum of consecutive naturals, for example, 18245 + ... + 23778.
It is an arithmetic number, because the mean of its divisors is an integer number (29080608).
Almost surely, 2116277641 is an apocalyptic number.
It is an amenable number.
116277641 is a deficient number, since it is larger than the sum of its proper divisors (44791).
116277641 is an equidigital number, since it uses as much as digits as its factorization.
116277641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44790.
The product of its digits is 14112, while the sum is 35.
The square root of 116277641 is about 10783.2110709195. The cubic root of 116277641 is about 488.0886823177.
The spelling of 116277641 in words is "one hundred sixteen million, two hundred seventy-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •