Base | Representation |
---|---|
bin | 110101010001101110… |
… | …1110011110001010011 |
3 | 101221022112201000122101 |
4 | 1222203131303301103 |
5 | 3333303340301011 |
6 | 124320542421231 |
7 | 11160140660122 |
oct | 1524335636123 |
9 | 357275630571 |
10 | 114411650131 |
11 | 44581437159 |
12 | 1a210291817 |
13 | aa344ab87c |
14 | 5775091ab9 |
15 | 2e995832c1 |
hex | 1aa3773c53 |
114411650131 has 2 divisors, whose sum is σ = 114411650132. Its totient is φ = 114411650130.
The previous prime is 114411650047. The next prime is 114411650153. The reversal of 114411650131 is 131056114411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114411650131 - 211 = 114411648083 is a prime.
It is a super-2 number, since 2×1144116501312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 114411650131.
It is not a weakly prime, because it can be changed into another prime (114411650161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57205825065 + 57205825066.
It is an arithmetic number, because the mean of its divisors is an integer number (57205825066).
Almost surely, 2114411650131 is an apocalyptic number.
114411650131 is a deficient number, since it is larger than the sum of its proper divisors (1).
114411650131 is an equidigital number, since it uses as much as digits as its factorization.
114411650131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 114411650131 its reverse (131056114411), we get a palindrome (245467764542).
The spelling of 114411650131 in words is "one hundred fourteen billion, four hundred eleven million, six hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •