Base | Representation |
---|---|
bin | 11010001010111110… |
… | …01101000000100001 |
3 | 1100021012212222222112 |
4 | 31011133031000201 |
5 | 212233440201122 |
6 | 10242123245105 |
7 | 1005122026514 |
oct | 150537150041 |
9 | 40235788875 |
10 | 14050709537 |
11 | 5a60294047 |
12 | 2881679795 |
13 | 142bc85217 |
14 | 974116d7b |
15 | 5737ed2e2 |
hex | 3457cd021 |
14050709537 has 2 divisors, whose sum is σ = 14050709538. Its totient is φ = 14050709536.
The previous prime is 14050709509. The next prime is 14050709567. The reversal of 14050709537 is 73590705041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14000568976 + 50140561 = 118324^2 + 7081^2 .
It is a cyclic number.
It is not a de Polignac number, because 14050709537 - 228 = 13782274081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14050709494 and 14050709503.
It is not a weakly prime, because it can be changed into another prime (14050709567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7025354768 + 7025354769.
It is an arithmetic number, because the mean of its divisors is an integer number (7025354769).
Almost surely, 214050709537 is an apocalyptic number.
It is an amenable number.
14050709537 is a deficient number, since it is larger than the sum of its proper divisors (1).
14050709537 is an equidigital number, since it uses as much as digits as its factorization.
14050709537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 132300, while the sum is 41.
The spelling of 14050709537 in words is "fourteen billion, fifty million, seven hundred nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •