Base | Representation |
---|---|
bin | 110000100001100001010… |
… | …000001001110011111101 |
3 | 102210202222212102100000022 |
4 | 300201201100021303331 |
5 | 414113102204334031 |
6 | 11031505445541525 |
7 | 462624445301246 |
oct | 60414120116375 |
9 | 12722885370008 |
10 | 3334526246141 |
11 | 107618a1537a2 |
12 | 45a3061148a5 |
13 | 1b25a168984c |
14 | b756b661ccd |
15 | 5bb130a197b |
hex | 30861409cfd |
3334526246141 has 2 divisors, whose sum is σ = 3334526246142. Its totient is φ = 3334526246140.
The previous prime is 3334526246099. The next prime is 3334526246153. The reversal of 3334526246141 is 1416426254333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2976418552900 + 358107693241 = 1725230^2 + 598421^2 .
It is a cyclic number.
It is not a de Polignac number, because 3334526246141 - 210 = 3334526245117 is a prime.
It is a super-2 number, since 2×33345262461412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3334526246092 and 3334526246101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3334526246171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1667263123070 + 1667263123071.
It is an arithmetic number, because the mean of its divisors is an integer number (1667263123071).
Almost surely, 23334526246141 is an apocalyptic number.
It is an amenable number.
3334526246141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3334526246141 is an equidigital number, since it uses as much as digits as its factorization.
3334526246141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1244160, while the sum is 44.
The spelling of 3334526246141 in words is "three trillion, three hundred thirty-four billion, five hundred twenty-six million, two hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •