Base | Representation |
---|---|
bin | 110000110001001100010… |
… | …110101101110100011101 |
3 | 102212101102201122201122112 |
4 | 300301030112231310131 |
5 | 414402034002423031 |
6 | 11043331431323405 |
7 | 464061466564445 |
oct | 60611426556435 |
9 | 12771381581575 |
10 | 3351355514141 |
11 | 10823358aa948 |
12 | 461622220565 |
13 | 1b40541a26ab |
14 | b82c67bb125 |
15 | 5c29a7a162b |
hex | 30c4c5add1d |
3351355514141 has 2 divisors, whose sum is σ = 3351355514142. Its totient is φ = 3351355514140.
The previous prime is 3351355514131. The next prime is 3351355514149. The reversal of 3351355514141 is 1414155531533.
3351355514141 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 can be written as a sum of positive squares in only one way, i.e., 3351224503225 + 131010916 = 1830635^2 + 11446^2 .
It is a cyclic number.
It is not a de Polignac number, because 3351355514141 - 234 = 3334175644957 is a prime.
It is a super-2 number, since 2×33513555141412 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3351355514149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1675677757070 + 1675677757071.
It is an arithmetic number, because the mean of its divisors is an integer number (1675677757071).
Almost surely, 23351355514141 is an apocalyptic number.
It is an amenable number.
3351355514141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3351355514141 is an equidigital number, since it uses as much as digits as its factorization.
3351355514141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 270000, while the sum is 41.
The spelling of 3351355514141 in words is "three trillion, three hundred fifty-one billion, three hundred fifty-five million, five hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •