Base | Representation |
---|---|
bin | 110110000101000100… |
… | …1110100111011011001 |
3 | 102002202121111002200102 |
4 | 1230022021310323121 |
5 | 3400320410341431 |
6 | 125203524345145 |
7 | 11250630444524 |
oct | 1541211647331 |
9 | 362677432612 |
10 | 116134465241 |
11 | 452859726a3 |
12 | 1a6112451b5 |
13 | ac4a3b59b2 |
14 | 5899bd5bbb |
15 | 304a941dcb |
hex | 1b0a274ed9 |
116134465241 has 2 divisors, whose sum is σ = 116134465242. Its totient is φ = 116134465240.
The previous prime is 116134465229. The next prime is 116134465259. The reversal of 116134465241 is 142564431611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80369982016 + 35764483225 = 283496^2 + 189115^2 .
It is a cyclic number.
It is not a de Polignac number, because 116134465241 - 26 = 116134465177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116134465195 and 116134465204.
It is not a weakly prime, because it can be changed into another prime (116134465211) 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, 58067232620 + 58067232621.
It is an arithmetic number, because the mean of its divisors is an integer number (58067232621).
Almost surely, 2116134465241 is an apocalyptic number.
It is an amenable number.
116134465241 is a deficient number, since it is larger than the sum of its proper divisors (1).
116134465241 is an equidigital number, since it uses as much as digits as its factorization.
116134465241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 38.
Adding to 116134465241 its reverse (142564431611), we get a palindrome (258698896852).
The spelling of 116134465241 in words is "one hundred sixteen billion, one hundred thirty-four million, four hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •