Base | Representation |
---|---|
bin | 1100100010000101… |
… | …0010110101110001 |
3 | 22200110021121012102 |
4 | 3020201102311301 |
5 | 23342211433441 |
6 | 1313453510145 |
7 | 146236661033 |
oct | 31041226561 |
9 | 8613247172 |
10 | 3364171121 |
11 | 1476a94613 |
12 | 79a7a2355 |
13 | 417c8c9cc |
14 | 23cb21c53 |
15 | 14a52b69b |
hex | c8852d71 |
3364171121 has 2 divisors, whose sum is σ = 3364171122. Its totient is φ = 3364171120.
The previous prime is 3364171117. The next prime is 3364171133. The reversal of 3364171121 is 1211714633.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3140369521 + 223801600 = 56039^2 + 14960^2 .
It is an emirp because it is prime and its reverse (1211714633) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3364171121 - 22 = 3364171117 is a prime.
It is a super-2 number, since 2×33641711212 = 22635294662740793282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3364177121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1682085560 + 1682085561.
It is an arithmetic number, because the mean of its divisors is an integer number (1682085561).
Almost surely, 23364171121 is an apocalyptic number.
It is an amenable number.
3364171121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3364171121 is an equidigital number, since it uses as much as digits as its factorization.
3364171121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3024, while the sum is 29.
The square root of 3364171121 is about 58001.4751622750. The cubic root of 3364171121 is about 1498.3940027585.
Adding to 3364171121 its reverse (1211714633), we get a palindrome (4575885754).
The spelling of 3364171121 in words is "three billion, three hundred sixty-four million, one hundred seventy-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •