Base | Representation |
---|---|
bin | 11010010101111011… |
… | …11100011010110011 |
3 | 1100111121220021020212 |
4 | 31022331330122303 |
5 | 212431004413011 |
6 | 10255210054335 |
7 | 1010316401534 |
oct | 151275743263 |
9 | 40447807225 |
10 | 14142654131 |
11 | 5aa8183411 |
12 | 28a841a3ab |
13 | 14450382c8 |
14 | 98240c68b |
15 | 57b91108b |
hex | 34af7c6b3 |
14142654131 has 2 divisors, whose sum is σ = 14142654132. Its totient is φ = 14142654130.
The previous prime is 14142654091. The next prime is 14142654133. The reversal of 14142654131 is 13145624141.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14142654131 is a prime.
It is a super-2 number, since 2×141426541312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 14142654133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14142654133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7071327065 + 7071327066.
It is an arithmetic number, because the mean of its divisors is an integer number (7071327066).
Almost surely, 214142654131 is an apocalyptic number.
14142654131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14142654131 is an equidigital number, since it uses as much as digits as its factorization.
14142654131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11520, while the sum is 32.
The spelling of 14142654131 in words is "fourteen billion, one hundred forty-two million, six hundred fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •