Base | Representation |
---|---|
bin | 110000101111111011000… |
… | …000000100111110010011 |
3 | 102212020220121101011222012 |
4 | 300233323000010332103 |
5 | 414341240100001141 |
6 | 11042544153133135 |
7 | 464012614325351 |
oct | 60577300047623 |
9 | 12766817334865 |
10 | 3349990625171 |
11 | 10817a5412633 |
12 | 4613010ba1ab |
13 | 1b3b97498398 |
14 | b81d74087d1 |
15 | 5c21aa44ceb |
hex | 30bfb004f93 |
3349990625171 has 2 divisors, whose sum is σ = 3349990625172. Its totient is φ = 3349990625170.
The previous prime is 3349990625123. The next prime is 3349990625183. The reversal of 3349990625171 is 1715260999433.
3349990625171 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3349990625171 - 226 = 3349923516307 is a prime.
It is a super-2 number, since 2×33499906251712 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3349990625171.
It is not a weakly prime, because it can be changed into another prime (3349990625101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1674995312585 + 1674995312586.
It is an arithmetic number, because the mean of its divisors is an integer number (1674995312586).
Almost surely, 23349990625171 is an apocalyptic number.
3349990625171 is a deficient number, since it is larger than the sum of its proper divisors (1).
3349990625171 is an equidigital number, since it uses as much as digits as its factorization.
3349990625171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11022480, while the sum is 59.
The spelling of 3349990625171 in words is "three trillion, three hundred forty-nine billion, nine hundred ninety million, six hundred twenty-five thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •