Base | Representation |
---|---|
bin | 110101000110… |
… | …010111010101 |
3 | 222012012020111 |
4 | 311012113111 |
5 | 12030412301 |
6 | 1214203021 |
7 | 226213135 |
oct | 65062725 |
9 | 28165214 |
10 | 13919701 |
11 | 7948094 |
12 | 47b3471 |
13 | 2b64a13 |
14 | 1bc4ac5 |
15 | 134e551 |
hex | d465d5 |
13919701 has 2 divisors, whose sum is σ = 13919702. Its totient is φ = 13919700.
The previous prime is 13919699. The next prime is 13919743. The reversal of 13919701 is 10791931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13616100 + 303601 = 3690^2 + 551^2 .
It is an emirp because it is prime and its reverse (10791931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13919701 - 21 = 13919699 is a prime.
Together with 13919699, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13919771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6959850 + 6959851.
It is an arithmetic number, because the mean of its divisors is an integer number (6959851).
Almost surely, 213919701 is an apocalyptic number.
It is an amenable number.
13919701 is a deficient number, since it is larger than the sum of its proper divisors (1).
13919701 is an equidigital number, since it uses as much as digits as its factorization.
13919701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 31.
The square root of 13919701 is about 3730.9115508144. The cubic root of 13919701 is about 240.5525521142.
The spelling of 13919701 in words is "thirteen million, nine hundred nineteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •