Base | Representation |
---|---|
bin | 11010001010111110… |
… | …01100111111111101 |
3 | 1100021012212222221012 |
4 | 31011133030333331 |
5 | 212233440201001 |
6 | 10242123245005 |
7 | 1005122026433 |
oct | 150537147775 |
9 | 40235788835 |
10 | 14050709501 |
11 | 5a60294014 |
12 | 2881679765 |
13 | 142bc851ba |
14 | 974116d53 |
15 | 5737ed2bb |
hex | 3457ccffd |
14050709501 has 2 divisors, whose sum is σ = 14050709502. Its totient is φ = 14050709500.
The previous prime is 14050709461. The next prime is 14050709503. The reversal of 14050709501 is 10590705041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12265562500 + 1785147001 = 110750^2 + 42251^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14050709501 is a prime.
Together with 14050709503, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14050709503) 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, 7025354750 + 7025354751.
It is an arithmetic number, because the mean of its divisors is an integer number (7025354751).
Almost surely, 214050709501 is an apocalyptic number.
It is an amenable number.
14050709501 is a deficient number, since it is larger than the sum of its proper divisors (1).
14050709501 is an equidigital number, since it uses as much as digits as its factorization.
14050709501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6300, while the sum is 32.
The spelling of 14050709501 in words is "fourteen billion, fifty million, seven hundred nine thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •