Base | Representation |
---|---|
bin | 11011110001110001… |
… | …10001011000011111 |
3 | 1102111022112102220111 |
4 | 31320320301120133 |
5 | 221020220101033 |
6 | 10503450230451 |
7 | 1035362556205 |
oct | 157070613037 |
9 | 42438472814 |
10 | 14913050143 |
11 | 6363034332 |
12 | 2a82425427 |
13 | 1538824534 |
14 | a1686d075 |
15 | 5c438b7cd |
hex | 378e3161f |
14913050143 has 2 divisors, whose sum is σ = 14913050144. Its totient is φ = 14913050142.
The previous prime is 14913050111. The next prime is 14913050147. The reversal of 14913050143 is 34105031941.
It is a strong prime.
It is an emirp because it is prime and its reverse (34105031941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14913050143 - 25 = 14913050111 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14913050147) 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, 7456525071 + 7456525072.
It is an arithmetic number, because the mean of its divisors is an integer number (7456525072).
Almost surely, 214913050143 is an apocalyptic number.
14913050143 is a deficient number, since it is larger than the sum of its proper divisors (1).
14913050143 is an equidigital number, since it uses as much as digits as its factorization.
14913050143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 14913050143 in words is "fourteen billion, nine hundred thirteen million, fifty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •