Base | Representation |
---|---|
bin | 1100001001010000010101… |
… | …0011110100010010111001 |
3 | 1202021112210110020101221012 |
4 | 3002110011103310102321 |
5 | 3222234213423414111 |
6 | 44222203211523305 |
7 | 2545506213455231 |
oct | 302240523642271 |
9 | 52245713211835 |
10 | 13353142404281 |
11 | 4289043853979 |
12 | 15b7b18459535 |
13 | 75b2715aaa54 |
14 | 34241cd6ccc1 |
15 | 18252c50d48b |
hex | c25054f44b9 |
13353142404281 has 2 divisors, whose sum is σ = 13353142404282. Its totient is φ = 13353142404280.
The previous prime is 13353142404157. The next prime is 13353142404311. The reversal of 13353142404281 is 18240424135331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10516919280400 + 2836223123881 = 3242980^2 + 1684109^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13353142404281 is a prime.
It is a super-2 number, since 2×133531424042812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13353142464281) 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, 6676571202140 + 6676571202141.
It is an arithmetic number, because the mean of its divisors is an integer number (6676571202141).
Almost surely, 213353142404281 is an apocalyptic number.
It is an amenable number.
13353142404281 is a deficient number, since it is larger than the sum of its proper divisors (1).
13353142404281 is an equidigital number, since it uses as much as digits as its factorization.
13353142404281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 41.
The spelling of 13353142404281 in words is "thirteen trillion, three hundred fifty-three billion, one hundred forty-two million, four hundred four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •