Base | Representation |
---|---|
bin | 1110100001110101… |
… | …0011001000101111 |
3 | 101001210112020221002 |
4 | 3220131103020233 |
5 | 30441344312141 |
6 | 1442554230515 |
7 | 165434256566 |
oct | 35035231057 |
9 | 11053466832 |
10 | 3899994671 |
11 | 17214997a1 |
12 | 90a12543b |
13 | 4a1ca8671 |
14 | 28dd60bdd |
15 | 17c5bde9b |
hex | e875322f |
3899994671 has 2 divisors, whose sum is σ = 3899994672. Its totient is φ = 3899994670.
The previous prime is 3899994653. The next prime is 3899994673. The reversal of 3899994671 is 1764999983.
It is a strong prime.
It is an emirp because it is prime and its reverse (1764999983) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3899994671 is a prime.
Together with 3899994673, 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 = 3899994598 and 3899994607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3899994673) 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, 1949997335 + 1949997336.
It is an arithmetic number, because the mean of its divisors is an integer number (1949997336).
Almost surely, 23899994671 is an apocalyptic number.
3899994671 is a deficient number, since it is larger than the sum of its proper divisors (1).
3899994671 is an equidigital number, since it uses as much as digits as its factorization.
3899994671 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 26453952, while the sum is 65.
The square root of 3899994671 is about 62449.9373178228. The cubic root of 3899994671 is about 1574.0601996935.
The spelling of 3899994671 in words is "three billion, eight hundred ninety-nine million, nine hundred ninety-four thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •