Base | Representation |
---|---|
bin | 11010011000110101001101… |
… | …101111010011001011000111 |
3 | 120012220210211101120000021002 |
4 | 122120311031233103023013 |
5 | 110202423400040101101 |
6 | 1050455114101043515 |
7 | 33305512225434104 |
oct | 3230651557231307 |
9 | 505823741500232 |
10 | 116055615550151 |
11 | 33a84a01461632 |
12 | 110244329b659b |
13 | 4c9acc79112c4 |
14 | 209319c195aab |
15 | d63d16036d6b |
hex | 698d4dbd32c7 |
116055615550151 has 2 divisors, whose sum is σ = 116055615550152. Its totient is φ = 116055615550150.
The previous prime is 116055615550123. The next prime is 116055615550153. The reversal of 116055615550151 is 151055516550611.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 116055615550151 - 210 = 116055615549127 is a prime.
It is a super-2 number, since 2×1160556155501512 (a number of 29 digits) contains 22 as substring.
Together with 116055615550153, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 116055615550096 and 116055615550105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116055615550153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58027807775075 + 58027807775076.
It is an arithmetic number, because the mean of its divisors is an integer number (58027807775076).
Almost surely, 2116055615550151 is an apocalyptic number.
116055615550151 is a deficient number, since it is larger than the sum of its proper divisors (1).
116055615550151 is an equidigital number, since it uses as much as digits as its factorization.
116055615550151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 562500, while the sum is 47.
The spelling of 116055615550151 in words is "one hundred sixteen trillion, fifty-five billion, six hundred fifteen million, five hundred fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •