Base | Representation |
---|---|
bin | 110110001010000100… |
… | …1111011111110011111 |
3 | 102010012022020021102101 |
4 | 1230110021323332133 |
5 | 3401141340010041 |
6 | 125232321105531 |
7 | 11255035644412 |
oct | 1542411737637 |
9 | 363168207371 |
10 | 116302266271 |
11 | 45361663034 |
12 | 1a6594882a7 |
13 | ac760a8149 |
14 | 58b41d5b79 |
15 | 305a53ab31 |
hex | 1b1427bf9f |
116302266271 has 4 divisors (see below), whose sum is σ = 122423438200. Its totient is φ = 110181094344.
The previous prime is 116302266259. The next prime is 116302266317. The reversal of 116302266271 is 172662203611.
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 116302266271 - 211 = 116302264223 is a prime.
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 116302266271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116302266221) 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, 3060585936 + ... + 3060585973.
It is an arithmetic number, because the mean of its divisors is an integer number (30605859550).
Almost surely, 2116302266271 is an apocalyptic number.
116302266271 is a deficient number, since it is larger than the sum of its proper divisors (6121171929).
116302266271 is an equidigital number, since it uses as much as digits as its factorization.
116302266271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6121171928.
The product of its (nonzero) digits is 36288, while the sum is 37.
Adding to 116302266271 its reverse (172662203611), we get a palindrome (288964469882).
The spelling of 116302266271 in words is "one hundred sixteen billion, three hundred two million, two hundred sixty-six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •