Base | Representation |
---|---|
bin | 110110001010110101… |
… | …0111110101110111011 |
3 | 102010021002002201112012 |
4 | 1230111222332232323 |
5 | 3401214343034111 |
6 | 125235030240135 |
7 | 11255465116352 |
oct | 1542552765673 |
9 | 363232081465 |
10 | 116327705531 |
11 | 45374a58a14 |
12 | 1a665ab604b |
13 | ac7b44426b |
14 | 58b7738999 |
15 | 305c8b348b |
hex | 1b15abebbb |
116327705531 has 2 divisors, whose sum is σ = 116327705532. Its totient is φ = 116327705530.
The previous prime is 116327705513. The next prime is 116327705573. The reversal of 116327705531 is 135507723611.
Together with previous prime (116327705513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 116327705531 - 26 = 116327705467 is a prime.
It is a super-2 number, since 2×1163277055312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (116327705731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58163852765 + 58163852766.
It is an arithmetic number, because the mean of its divisors is an integer number (58163852766).
Almost surely, 2116327705531 is an apocalyptic number.
116327705531 is a deficient number, since it is larger than the sum of its proper divisors (1).
116327705531 is an equidigital number, since it uses as much as digits as its factorization.
116327705531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 132300, while the sum is 41.
The spelling of 116327705531 in words is "one hundred sixteen billion, three hundred twenty-seven million, seven hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •