Base | Representation |
---|---|
bin | 11010011011001010001011… |
… | …100011110010110000101111 |
3 | 120020111002200122111201101202 |
4 | 122123022023203302300233 |
5 | 110213033440011324101 |
6 | 1051100405541200115 |
7 | 33323204035244342 |
oct | 3233121343626057 |
9 | 506432618451352 |
10 | 116215566511151 |
11 | 3403682161aa98 |
12 | 1104b43210003b |
13 | 4cb010896b063 |
14 | 209ac13382459 |
15 | d6807853936b |
hex | 69b28b8f2c2f |
116215566511151 has 2 divisors, whose sum is σ = 116215566511152. Its totient is φ = 116215566511150.
The previous prime is 116215566511139. The next prime is 116215566511189. The reversal of 116215566511151 is 151115665512611.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 116215566511151 - 218 = 116215566249007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116215566511096 and 116215566511105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116215566510151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58107783255575 + 58107783255576.
It is an arithmetic number, because the mean of its divisors is an integer number (58107783255576).
Almost surely, 2116215566511151 is an apocalyptic number.
116215566511151 is a deficient number, since it is larger than the sum of its proper divisors (1).
116215566511151 is an equidigital number, since it uses as much as digits as its factorization.
116215566511151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 270000, while the sum is 47.
The spelling of 116215566511151 in words is "one hundred sixteen trillion, two hundred fifteen billion, five hundred sixty-six million, five hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •