Base | Representation |
---|---|
bin | 1011101100111011101… |
… | …1000101100111110111 |
3 | 201012220211101210222222 |
4 | 2323032323011213313 |
5 | 11243212230413024 |
6 | 232205002512555 |
7 | 20344650404102 |
oct | 2731673054767 |
9 | 635824353888 |
10 | 201040091639 |
11 | 78295988472 |
12 | 32b67b0575b |
13 | 15c5b95580a |
14 | 9a322a7739 |
15 | 536992485e |
hex | 2eceec59f7 |
201040091639 has 2 divisors, whose sum is σ = 201040091640. Its totient is φ = 201040091638.
The previous prime is 201040091633. The next prime is 201040091641. The reversal of 201040091639 is 936190040102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201040091639 - 212 = 201040087543 is a prime.
Together with 201040091641, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 201040091599 and 201040091608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201040091633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100520045819 + 100520045820.
It is an arithmetic number, because the mean of its divisors is an integer number (100520045820).
Almost surely, 2201040091639 is an apocalyptic number.
201040091639 is a deficient number, since it is larger than the sum of its proper divisors (1).
201040091639 is an equidigital number, since it uses as much as digits as its factorization.
201040091639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 35.
The spelling of 201040091639 in words is "two hundred one billion, forty million, ninety-one thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •