Base | Representation |
---|---|
bin | 11011010011101111… |
… | …01111110000111011 |
3 | 1101211202111020000102 |
4 | 31221313233300323 |
5 | 220011221420011 |
6 | 10422450430015 |
7 | 1026213330134 |
oct | 155167576073 |
9 | 41752436012 |
10 | 14661123131 |
11 | 6243904896 |
12 | 2a11b9230b |
13 | 14c85889b5 |
14 | 9d1210c8b |
15 | 5ac1c673b |
hex | 369defc3b |
14661123131 has 2 divisors, whose sum is σ = 14661123132. Its totient is φ = 14661123130.
The previous prime is 14661123077. The next prime is 14661123133. The reversal of 14661123131 is 13132116641.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14661123131 - 218 = 14660860987 is a prime.
It is a super-3 number, since 3×146611231313 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 14661123133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 14661123094 and 14661123103.
It is not a weakly prime, because it can be changed into another prime (14661123133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7330561565 + 7330561566.
It is an arithmetic number, because the mean of its divisors is an integer number (7330561566).
Almost surely, 214661123131 is an apocalyptic number.
14661123131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14661123131 is an equidigital number, since it uses as much as digits as its factorization.
14661123131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 29.
Adding to 14661123131 its reverse (13132116641), we get a palindrome (27793239772).
The spelling of 14661123131 in words is "fourteen billion, six hundred sixty-one million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •