Base | Representation |
---|---|
bin | 100010001000001… |
… | …0001000111101001 |
3 | 2221210201212121212 |
4 | 1010100101013221 |
5 | 4321122140423 |
6 | 305343442505 |
7 | 40243214012 |
oct | 10420210751 |
9 | 2853655555 |
10 | 1145115113 |
11 | 538429a2a |
12 | 27b5b6435 |
13 | 15331880c |
14 | ac124009 |
15 | 6a7e8578 |
hex | 444111e9 |
1145115113 has 2 divisors, whose sum is σ = 1145115114. Its totient is φ = 1145115112.
The previous prime is 1145115077. The next prime is 1145115131. The reversal of 1145115113 is 3115115411.
Together with next prime (1145115131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 834227689 + 310887424 = 28883^2 + 17632^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145115113 - 220 = 1144066537 is a prime.
It is a super-2 number, since 2×11451151132 = 2622577244042005538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1145115163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572557556 + 572557557.
It is an arithmetic number, because the mean of its divisors is an integer number (572557557).
Almost surely, 21145115113 is an apocalyptic number.
It is an amenable number.
1145115113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145115113 is an equidigital number, since it uses as much as digits as its factorization.
1145115113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 300, while the sum is 23.
The square root of 1145115113 is about 33839.5495389640. The cubic root of 1145115113 is about 1046.2040144378.
The spelling of 1145115113 in words is "one billion, one hundred forty-five million, one hundred fifteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •