Base | Representation |
---|---|
bin | 1111001010011000… |
… | …11110000101001101 |
3 | 210000022020221210112 |
4 | 13211030132011031 |
5 | 113132343444301 |
6 | 3423425045405 |
7 | 405502501016 |
oct | 74514360515 |
9 | 23008227715 |
10 | 8140218701 |
11 | 34a7a3987a |
12 | 16b2186865 |
13 | 9c95c8b74 |
14 | 57316800d |
15 | 3299969bb |
hex | 1e531e14d |
8140218701 has 2 divisors, whose sum is σ = 8140218702. Its totient is φ = 8140218700.
The previous prime is 8140218649. The next prime is 8140218703. The reversal of 8140218701 is 1078120418.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8123416900 + 16801801 = 90130^2 + 4099^2 .
It is a cyclic number.
It is not a de Polignac number, because 8140218701 - 26 = 8140218637 is a prime.
It is a super-2 number, since 2×81402187012 (a number of 21 digits) contains 22 as substring.
Together with 8140218703, 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 (8140218703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4070109350 + 4070109351.
It is an arithmetic number, because the mean of its divisors is an integer number (4070109351).
Almost surely, 28140218701 is an apocalyptic number.
It is an amenable number.
8140218701 is a deficient number, since it is larger than the sum of its proper divisors (1).
8140218701 is an equidigital number, since it uses as much as digits as its factorization.
8140218701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3584, while the sum is 32.
The square root of 8140218701 is about 90223.1605575863. The cubic root of 8140218701 is about 2011.6172804902.
The spelling of 8140218701 in words is "eight billion, one hundred forty million, two hundred eighteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •