Base | Representation |
---|---|
bin | 110001100001100101111… |
… | …011001110100001111101 |
3 | 110001100120111202121022021 |
4 | 301201211323032201331 |
5 | 421230001433421021 |
6 | 11123244315120141 |
7 | 500611354511416 |
oct | 61414573164175 |
9 | 13040514677267 |
10 | 3403324123261 |
11 | 10a238381a087 |
12 | 46b706443051 |
13 | 1b8c16a4868a |
14 | baa1675480d |
15 | 5d7dcda7c41 |
hex | 31865ece87d |
3403324123261 has 2 divisors, whose sum is σ = 3403324123262. Its totient is φ = 3403324123260.
The previous prime is 3403324123211. The next prime is 3403324123313. The reversal of 3403324123261 is 1623214233043.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1956851265625 + 1446472857636 = 1398875^2 + 1202694^2 .
It is a cyclic number.
It is not a de Polignac number, because 3403324123261 - 211 = 3403324121213 is a prime.
It is a super-3 number, since 3×34033241232613 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3403324123211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1701662061630 + 1701662061631.
It is an arithmetic number, because the mean of its divisors is an integer number (1701662061631).
Almost surely, 23403324123261 is an apocalyptic number.
It is an amenable number.
3403324123261 is a deficient number, since it is larger than the sum of its proper divisors (1).
3403324123261 is an equidigital number, since it uses as much as digits as its factorization.
3403324123261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 34.
The spelling of 3403324123261 in words is "three trillion, four hundred three billion, three hundred twenty-four million, one hundred twenty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •