Base | Representation |
---|---|
bin | 10010110000011111… |
… | …101100010010011111 |
3 | 1220222122210010201101 |
4 | 102300133230102133 |
5 | 312222041421241 |
6 | 13130322453531 |
7 | 1312053252421 |
oct | 226037542237 |
9 | 56878703641 |
10 | 20140967071 |
11 | 85a6061735 |
12 | 3aa12042a7 |
13 | 1b8c9631c4 |
14 | d90cdc811 |
15 | 7cd313e31 |
hex | 4b07ec49f |
20140967071 has 2 divisors, whose sum is σ = 20140967072. Its totient is φ = 20140967070.
The previous prime is 20140967053. The next prime is 20140967087. The reversal of 20140967071 is 17076904102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20140967071 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20140967071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20140964071) 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, 10070483535 + 10070483536.
It is an arithmetic number, because the mean of its divisors is an integer number (10070483536).
Almost surely, 220140967071 is an apocalyptic number.
20140967071 is a deficient number, since it is larger than the sum of its proper divisors (1).
20140967071 is an equidigital number, since it uses as much as digits as its factorization.
20140967071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21168, while the sum is 37.
The spelling of 20140967071 in words is "twenty billion, one hundred forty million, nine hundred sixty-seven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •