Base | Representation |
---|---|
bin | 110110001010010110… |
… | …0111010110100000111 |
3 | 102010012221111011200101 |
4 | 1230110230322310013 |
5 | 3401201211432201 |
6 | 125233245424531 |
7 | 11255206620052 |
oct | 1542454726407 |
9 | 363187434611 |
10 | 116311436551 |
11 | 45366856882 |
12 | 1a66056b147 |
13 | ac77c6914b |
14 | 58b5501a99 |
15 | 305b24cd01 |
hex | 1b14b3ad07 |
116311436551 has 2 divisors, whose sum is σ = 116311436552. Its totient is φ = 116311436550.
The previous prime is 116311436509. The next prime is 116311436557. The reversal of 116311436551 is 155634113611.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116311436551 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116311436551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116311436557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58155718275 + 58155718276.
It is an arithmetic number, because the mean of its divisors is an integer number (58155718276).
Almost surely, 2116311436551 is an apocalyptic number.
116311436551 is a deficient number, since it is larger than the sum of its proper divisors (1).
116311436551 is an equidigital number, since it uses as much as digits as its factorization.
116311436551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32400, while the sum is 37.
The spelling of 116311436551 in words is "one hundred sixteen billion, three hundred eleven million, four hundred thirty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •