Base | Representation |
---|---|
bin | 1100010011010000… |
… | …0001000101111001 |
3 | 22112010020110201012 |
4 | 3010310001011321 |
5 | 23230301022142 |
6 | 1303352403305 |
7 | 144553166363 |
oct | 30464010571 |
9 | 8463213635 |
10 | 3301970297 |
11 | 144497017a |
12 | 7819a6535 |
13 | 4081220a2 |
14 | 23476dd33 |
15 | 144d41882 |
hex | c4d01179 |
3301970297 has 4 divisors (see below), whose sum is σ = 3305174016. Its totient is φ = 3298766580.
The previous prime is 3301970291. The next prime is 3301970359. The reversal of 3301970297 is 7920791033.
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 an emirpimes, since its reverse is a distinct semiprime: 7920791033 = 1559 ⋅5080687.
It is a cyclic number.
It is not a de Polignac number, because 3301970297 - 28 = 3301970041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3301970291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1600313 + ... + 1602374.
It is an arithmetic number, because the mean of its divisors is an integer number (826293504).
Almost surely, 23301970297 is an apocalyptic number.
It is an amenable number.
3301970297 is a deficient number, since it is larger than the sum of its proper divisors (3203719).
3301970297 is a wasteful number, since it uses less digits than its factorization.
3301970297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203718.
The product of its (nonzero) digits is 71442, while the sum is 41.
The square root of 3301970297 is about 57462.7731405299. The cubic root of 3301970297 is about 1489.1017959342.
The spelling of 3301970297 in words is "three billion, three hundred one million, nine hundred seventy thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •