Base | Representation |
---|---|
bin | 11001111101101101… |
… | …11110010001101111 |
3 | 1022222110121222101002 |
4 | 30332312332101233 |
5 | 212022003001033 |
6 | 10223111510515 |
7 | 1002301540052 |
oct | 147666762157 |
9 | 38873558332 |
10 | 13939500143 |
11 | 5a03536858 |
12 | 285038843b |
13 | 1411c1854a |
14 | 963448a99 |
15 | 568b823e8 |
hex | 33edbe46f |
13939500143 has 2 divisors, whose sum is σ = 13939500144. Its totient is φ = 13939500142.
The previous prime is 13939500137. The next prime is 13939500163. The reversal of 13939500143 is 34100593931.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13939500143 - 28 = 13939499887 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 13939500097 and 13939500106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13939500163) 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, 6969750071 + 6969750072.
It is an arithmetic number, because the mean of its divisors is an integer number (6969750072).
Almost surely, 213939500143 is an apocalyptic number.
13939500143 is a deficient number, since it is larger than the sum of its proper divisors (1).
13939500143 is an equidigital number, since it uses as much as digits as its factorization.
13939500143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 38.
The spelling of 13939500143 in words is "thirteen billion, nine hundred thirty-nine million, five hundred thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •