Base | Representation |
---|---|
bin | 10000010001111000… |
… | …11101001110110011 |
3 | 211120002212001000022 |
4 | 20020330131032303 |
5 | 120344420010231 |
6 | 4003132314055 |
7 | 426404531402 |
oct | 101074351663 |
9 | 24502761008 |
10 | 8740000691 |
11 | 3785558974 |
12 | 183b01292b |
13 | a93949456 |
14 | 5cca95639 |
15 | 36246ec7b |
hex | 208f1d3b3 |
8740000691 has 2 divisors, whose sum is σ = 8740000692. Its totient is φ = 8740000690.
The previous prime is 8740000663. The next prime is 8740000693. The reversal of 8740000691 is 1960000478.
8740000691 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8740000691 is a prime.
It is a super-2 number, since 2×87400006912 (a number of 21 digits) contains 22 as substring.
Together with 8740000693, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (8740000693) 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, 4370000345 + 4370000346.
It is an arithmetic number, because the mean of its divisors is an integer number (4370000346).
Almost surely, 28740000691 is an apocalyptic number.
8740000691 is a deficient number, since it is larger than the sum of its proper divisors (1).
8740000691 is an equidigital number, since it uses as much as digits as its factorization.
8740000691 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 35.
The square root of 8740000691 is about 93487.9708358246. The cubic root of 8740000691 is about 2059.8573982256.
The spelling of 8740000691 in words is "eight billion, seven hundred forty million, six hundred ninety-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •