Base | Representation |
---|---|
bin | 110010000010010110011… |
… | …000111011001010110101 |
3 | 110011201100202122111002111 |
4 | 302002112120323022311 |
5 | 422314020204444023 |
6 | 11151342415011021 |
7 | 503265105600523 |
oct | 62022630731265 |
9 | 13151322574074 |
10 | 3438496953013 |
11 | 1106292985721 |
12 | 4764a1809a71 |
13 | 1bc330a02685 |
14 | bc5d1bad313 |
15 | 5e69abc700d |
hex | 3209663b2b5 |
3438496953013 has 2 divisors, whose sum is σ = 3438496953014. Its totient is φ = 3438496953012.
The previous prime is 3438496952911. The next prime is 3438496953037. The reversal of 3438496953013 is 3103596948343.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3436103590929 + 2393362084 = 1853673^2 + 48922^2 .
It is an emirp because it is prime and its reverse (3103596948343) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3438496953013 - 213 = 3438496944821 is a prime.
It is a super-2 number, since 2×34384969530132 (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 (3438496953413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1719248476506 + 1719248476507.
It is an arithmetic number, because the mean of its divisors is an integer number (1719248476507).
Almost surely, 23438496953013 is an apocalyptic number.
It is an amenable number.
3438496953013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3438496953013 is an equidigital number, since it uses as much as digits as its factorization.
3438496953013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25194240, while the sum is 58.
The spelling of 3438496953013 in words is "three trillion, four hundred thirty-eight billion, four hundred ninety-six million, nine hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •