Base | Representation |
---|---|
bin | 11010011000000101011010… |
… | …101001011101010001000001 |
3 | 120012201220100121012200102221 |
4 | 122120011122221131101001 |
5 | 110201103242340434011 |
6 | 1050415345234211041 |
7 | 33302014340020501 |
oct | 3230053251352101 |
9 | 505656317180387 |
10 | 116004292514881 |
11 | 33a65164998601 |
12 | 110164aaa23a81 |
13 | 4c96208a2c794 |
14 | 20908cdc69a01 |
15 | d62810451971 |
hex | 69815aa5d441 |
116004292514881 has 2 divisors, whose sum is σ = 116004292514882. Its totient is φ = 116004292514880.
The previous prime is 116004292514861. The next prime is 116004292514987. The reversal of 116004292514881 is 188415292400611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113416003593025 + 2588288921856 = 10649695^2 + 1608816^2 .
It is a cyclic number.
It is not a de Polignac number, because 116004292514881 - 25 = 116004292514849 is a prime.
It is a super-3 number, since 3×1160042925148813 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (116004292514861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58002146257440 + 58002146257441.
It is an arithmetic number, because the mean of its divisors is an integer number (58002146257441).
Almost surely, 2116004292514881 is an apocalyptic number.
It is an amenable number.
116004292514881 is a deficient number, since it is larger than the sum of its proper divisors (1).
116004292514881 is an equidigital number, since it uses as much as digits as its factorization.
116004292514881 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1105920, while the sum is 52.
The spelling of 116004292514881 in words is "one hundred sixteen trillion, four billion, two hundred ninety-two million, five hundred fourteen thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •