Base | Representation |
---|---|
bin | 1110101011111001… |
… | …0010000111101001 |
3 | 101011201221021211202 |
4 | 3222332102013221 |
5 | 31033200230224 |
6 | 1451102533545 |
7 | 166456052615 |
oct | 35276220751 |
9 | 11151837752 |
10 | 3942195689 |
11 | 17432a2a73 |
12 | 9202972b5 |
13 | 4aa962c93 |
14 | 2957c8345 |
15 | 181157eae |
hex | eaf921e9 |
3942195689 has 4 divisors (see below), whose sum is σ = 3942329424. Its totient is φ = 3942061956.
The previous prime is 3942195683. The next prime is 3942195737. The reversal of 3942195689 is 9865912493.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 9865912493 = 52709 ⋅187177.
It is a cyclic number.
It is not a de Polignac number, because 3942195689 - 212 = 3942191593 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3942195683) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1067 + ... + 88800.
It is an arithmetic number, because the mean of its divisors is an integer number (985582356).
Almost surely, 23942195689 is an apocalyptic number.
It is an amenable number.
3942195689 is a deficient number, since it is larger than the sum of its proper divisors (133735).
3942195689 is an equidigital number, since it uses as much as digits as its factorization.
3942195689 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133734.
The product of its digits is 4199040, while the sum is 56.
The square root of 3942195689 is about 62786.9069870463. The cubic root of 3942195689 is about 1579.7173677277.
The spelling of 3942195689 in words is "three billion, nine hundred forty-two million, one hundred ninety-five thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •