Base | Representation |
---|---|
bin | 110110001010011101… |
… | …0101011111010001001 |
3 | 102010020012021112020122 |
4 | 1230110322223322021 |
5 | 3401203122424023 |
6 | 125233455033025 |
7 | 11255252400602 |
oct | 1542472537211 |
9 | 363205245218 |
10 | 116315045513 |
11 | 453688a1297 |
12 | 1a66180b775 |
13 | ac78930a24 |
14 | 58b5ba0da9 |
15 | 305b7122c8 |
hex | 1b14eabe89 |
116315045513 has 2 divisors, whose sum is σ = 116315045514. Its totient is φ = 116315045512.
The previous prime is 116315045501. The next prime is 116315045521. The reversal of 116315045513 is 315540513611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99282968464 + 17032077049 = 315092^2 + 130507^2 .
It is a cyclic number.
It is not a de Polignac number, because 116315045513 - 218 = 116314783369 is a prime.
It is a super-2 number, since 2×1163150455132 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (116315045563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58157522756 + 58157522757.
It is an arithmetic number, because the mean of its divisors is an integer number (58157522757).
Almost surely, 2116315045513 is an apocalyptic number.
It is an amenable number.
116315045513 is a deficient number, since it is larger than the sum of its proper divisors (1).
116315045513 is an equidigital number, since it uses as much as digits as its factorization.
116315045513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 116315045513 in words is "one hundred sixteen billion, three hundred fifteen million, forty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •