Base | Representation |
---|---|
bin | 110000100001011000010… |
… | …011001011100110011101 |
3 | 102210202121101210022201111 |
4 | 300201120103023212131 |
5 | 414112300231414312 |
6 | 11031442522342021 |
7 | 462620642513026 |
oct | 60413023134635 |
9 | 12722541708644 |
10 | 3334376044957 |
11 | 1076112394391 |
12 | 45a28395a911 |
13 | 1b257951a1c9 |
14 | b7555723c4d |
15 | 5bb04cd28a7 |
hex | 308584cb99d |
3334376044957 has 2 divisors, whose sum is σ = 3334376044958. Its totient is φ = 3334376044956.
The previous prime is 3334376044859. The next prime is 3334376045023. The reversal of 3334376044957 is 7594406734333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1748038313956 + 1586337731001 = 1322134^2 + 1259499^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3334376044957 is a prime.
It is a super-2 number, since 2×33343760449572 (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 (3334376044757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1667188022478 + 1667188022479.
It is an arithmetic number, because the mean of its divisors is an integer number (1667188022479).
Almost surely, 23334376044957 is an apocalyptic number.
It is an amenable number.
3334376044957 is a deficient number, since it is larger than the sum of its proper divisors (1).
3334376044957 is an equidigital number, since it uses as much as digits as its factorization.
3334376044957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68584320, while the sum is 58.
The spelling of 3334376044957 in words is "three trillion, three hundred thirty-four billion, three hundred seventy-six million, forty-four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •