Base | Representation |
---|---|
bin | 110110001010011011… |
… | …1100000001101000101 |
3 | 102010020010201010200222 |
4 | 1230110313200031011 |
5 | 3401202414224031 |
6 | 125233425114125 |
7 | 11255242324202 |
oct | 1542467401505 |
9 | 363203633628 |
10 | 116314211141 |
11 | 45368381427 |
12 | 1a661488945 |
13 | ac786cb00b |
14 | 58b5a24ca9 |
15 | 305b5e9e7b |
hex | 1b14de0345 |
116314211141 has 2 divisors, whose sum is σ = 116314211142. Its totient is φ = 116314211140.
The previous prime is 116314211107. The next prime is 116314211203. The reversal of 116314211141 is 141112413611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106311210916 + 10003000225 = 326054^2 + 100015^2 .
It is a cyclic number.
It is not a de Polignac number, because 116314211141 - 214 = 116314194757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116314211141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116314211341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58157105570 + 58157105571.
It is an arithmetic number, because the mean of its divisors is an integer number (58157105571).
Almost surely, 2116314211141 is an apocalyptic number.
It is an amenable number.
116314211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
116314211141 is an equidigital number, since it uses as much as digits as its factorization.
116314211141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 576, while the sum is 26.
Adding to 116314211141 its reverse (141112413611), we get a palindrome (257426624752).
The spelling of 116314211141 in words is "one hundred sixteen billion, three hundred fourteen million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •