Base | Representation |
---|---|
bin | 1100011111101010… |
… | …0101100011100001 |
3 | 22122202012002012002 |
4 | 3013322211203201 |
5 | 23332112233121 |
6 | 1312452213345 |
7 | 146054510045 |
oct | 30772454341 |
9 | 8582162162 |
10 | 3354024161 |
11 | 1471293aa4 |
12 | 79730a255 |
13 | 415b492a7 |
14 | 23b640025 |
15 | 1496c4e0b |
hex | c7ea58e1 |
3354024161 has 2 divisors, whose sum is σ = 3354024162. Its totient is φ = 3354024160.
The previous prime is 3354024119. The next prime is 3354024169. The reversal of 3354024161 is 1614204533.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3340840000 + 13184161 = 57800^2 + 3631^2 .
It is a cyclic number.
It is not a de Polignac number, because 3354024161 - 218 = 3353762017 is a prime.
It is a super-2 number, since 2×33540241612 = 22498956145143507842, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3354024169) 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, 1677012080 + 1677012081.
It is an arithmetic number, because the mean of its divisors is an integer number (1677012081).
Almost surely, 23354024161 is an apocalyptic number.
It is an amenable number.
3354024161 is a deficient number, since it is larger than the sum of its proper divisors (1).
3354024161 is an equidigital number, since it uses as much as digits as its factorization.
3354024161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 3354024161 is about 57913.9375366587. The cubic root of 3354024161 is about 1496.8860081396.
Adding to 3354024161 its reverse (1614204533), we get a palindrome (4968228694).
The spelling of 3354024161 in words is "three billion, three hundred fifty-four million, twenty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •