Base | Representation |
---|---|
bin | 1101110111010… |
… | …01100111100101 |
3 | 22002211122222002 |
4 | 12323221213211 |
5 | 214233102021 |
6 | 15312415045 |
7 | 2611351550 |
oct | 673514745 |
9 | 262748862 |
10 | 116300261 |
11 | 5a715120 |
12 | 32b47485 |
13 | 1b12cc2c |
14 | 11635697 |
15 | a32450b |
hex | 6ee99e5 |
116300261 has 8 divisors (see below), whose sum is σ = 144997824. Its totient is φ = 90623520.
The previous prime is 116300257. The next prime is 116300263. The reversal of 116300261 is 162003611.
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 116300261 - 22 = 116300257 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116300263) 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, 755120 + ... + 755273.
It is an arithmetic number, because the mean of its divisors is an integer number (18124728).
Almost surely, 2116300261 is an apocalyptic number.
116300261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116300261 is a deficient number, since it is larger than the sum of its proper divisors (28697563).
116300261 is a wasteful number, since it uses less digits than its factorization.
116300261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510411.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 116300261 is about 10784.2598726106. The cubic root of 116300261 is about 488.1203302770.
Adding to 116300261 its reverse (162003611), we get a palindrome (278303872).
The spelling of 116300261 in words is "one hundred sixteen million, three hundred thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •