Base | Representation |
---|---|
bin | 1101111001101… |
… | …11111111111111 |
3 | 22010102222100211 |
4 | 12330313333333 |
5 | 214323340221 |
6 | 15323333251 |
7 | 2614156552 |
oct | 674677777 |
9 | 263388324 |
10 | 116621311 |
11 | 5a914354 |
12 | 33081227 |
13 | 1b2130c1 |
14 | 116ba699 |
15 | a3896e1 |
hex | 6f37fff |
116621311 has 4 divisors (see below), whose sum is σ = 117653472. Its totient is φ = 115589152.
The previous prime is 116621303. The next prime is 116621341. The reversal of 116621311 is 113126611.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 116621311 - 23 = 116621303 is a prime.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116621341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 515911 + ... + 516136.
It is an arithmetic number, because the mean of its divisors is an integer number (29413368).
Almost surely, 2116621311 is an apocalyptic number.
116621311 is a deficient number, since it is larger than the sum of its proper divisors (1032161).
116621311 is a wasteful number, since it uses less digits than its factorization.
116621311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1032160.
The product of its digits is 216, while the sum is 22.
The square root of 116621311 is about 10799.1347338572. The cubic root of 116621311 is about 488.5690740424.
Adding to 116621311 its reverse (113126611), we get a palindrome (229747922).
The spelling of 116621311 in words is "one hundred sixteen million, six hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •