Base | Representation |
---|---|
bin | 100001010001001… |
… | …0110011111111011 |
3 | 2212210111222111212 |
4 | 1002202112133323 |
5 | 4241233120212 |
6 | 302434113335 |
7 | 36443255522 |
oct | 10242263773 |
9 | 2783458455 |
10 | 1116301307 |
11 | 523139770 |
12 | 271a1b84b |
13 | 14a36a724 |
14 | a83834b9 |
15 | 68005e22 |
hex | 428967fb |
1116301307 has 4 divisors (see below), whose sum is σ = 1217783256. Its totient is φ = 1014819360.
The previous prime is 1116301273. The next prime is 1116301337. The reversal of 1116301307 is 7031036111.
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 1116301307 - 28 = 1116301051 is a prime.
It is a super-2 number, since 2×11163013072 = 2492257216019816498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1116301337) 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 3 ways as a sum of consecutive naturals, for example, 50740958 + ... + 50740979.
It is an arithmetic number, because the mean of its divisors is an integer number (304445814).
Almost surely, 21116301307 is an apocalyptic number.
1116301307 is a deficient number, since it is larger than the sum of its proper divisors (101481949).
1116301307 is a wasteful number, since it uses less digits than its factorization.
1116301307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101481948.
The product of its (nonzero) digits is 378, while the sum is 23.
The square root of 1116301307 is about 33411.0955671914. The cubic root of 1116301307 is about 1037.3543785941.
Adding to 1116301307 its reverse (7031036111), we get a palindrome (8147337418).
The spelling of 1116301307 in words is "one billion, one hundred sixteen million, three hundred one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •