Base | Representation |
---|---|
bin | 1100010010110100… |
… | …0010100000010001 |
3 | 22111222210112111011 |
4 | 3010231002200101 |
5 | 23224314003243 |
6 | 1303245250521 |
7 | 144531510355 |
oct | 30455024021 |
9 | 8458715434 |
10 | 3300141073 |
11 | 1443930919 |
12 | 781263a41 |
13 | 4079315c8 |
14 | 234415465 |
15 | 144ace89d |
hex | c4b42811 |
3300141073 has 2 divisors, whose sum is σ = 3300141074. Its totient is φ = 3300141072.
The previous prime is 3300140959. The next prime is 3300141139. The reversal of 3300141073 is 3701410033.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2536834689 + 763306384 = 50367^2 + 27628^2 .
It is a cyclic number.
It is not a de Polignac number, because 3300141073 - 213 = 3300132881 is a prime.
It is a super-2 number, since 2×33001410732 = 21781862203403182658, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3300148073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650070536 + 1650070537.
It is an arithmetic number, because the mean of its divisors is an integer number (1650070537).
Almost surely, 23300141073 is an apocalyptic number.
It is an amenable number.
3300141073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3300141073 is an equidigital number, since it uses as much as digits as its factorization.
3300141073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
The square root of 3300141073 is about 57446.8543351157. The cubic root of 3300141073 is about 1488.8267678299.
The spelling of 3300141073 in words is "three billion, three hundred million, one hundred forty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •