Base | Representation |
---|---|
bin | 1100000100111110… |
… | …0111100101001011 |
3 | 22100221120120221121 |
4 | 3001033213211023 |
5 | 23114434100341 |
6 | 1253413220111 |
7 | 143225240521 |
oct | 30117474513 |
9 | 8327516847 |
10 | 3242096971 |
11 | 1414096493 |
12 | 765931637 |
13 | 3c88ba999 |
14 | 22a826311 |
15 | 13e9664d1 |
hex | c13e794b |
3242096971 has 4 divisors (see below), whose sum is σ = 3255013944. Its totient is φ = 3229180000.
The previous prime is 3242096953. The next prime is 3242096987. The reversal of 3242096971 is 1796902423.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1796902423 = 22637 ⋅79379.
It is a cyclic number.
It is not a de Polignac number, because 3242096971 - 219 = 3241572683 is a prime.
It is a super-2 number, since 2×32420969712 = 21022385538734749682, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3242096941) 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 in 3 ways as a sum of consecutive naturals, for example, 6458110 + ... + 6458611.
It is an arithmetic number, because the mean of its divisors is an integer number (813753486).
Almost surely, 23242096971 is an apocalyptic number.
3242096971 is a deficient number, since it is larger than the sum of its proper divisors (12916973).
3242096971 is a wasteful number, since it uses less digits than its factorization.
3242096971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12916972.
The product of its (nonzero) digits is 163296, while the sum is 43.
The square root of 3242096971 is about 56939.4149162072. The cubic root of 3242096971 is about 1480.0464087894.
The spelling of 3242096971 in words is "three billion, two hundred forty-two million, ninety-six thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •