Base | Representation |
---|---|
bin | 1100001000001101011111… |
… | …1011001011111000110001 |
3 | 1202012211111002111212222022 |
4 | 3002003113323023320301 |
5 | 3221440442440302114 |
6 | 44210035023321225 |
7 | 2544302500101503 |
oct | 302032773137061 |
9 | 52184432455868 |
10 | 13335201103409 |
11 | 4281477413a99 |
12 | 15b454ba50215 |
13 | 7596725902a3 |
14 | 3415da261d73 |
15 | 181d2c39c48e |
hex | c20d7ecbe31 |
13335201103409 has 2 divisors, whose sum is σ = 13335201103410. Its totient is φ = 13335201103408.
The previous prime is 13335201103387. The next prime is 13335201103481. The reversal of 13335201103409 is 90430110253331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10820994462784 + 2514206640625 = 3289528^2 + 1585625^2 .
It is a cyclic number.
It is not a de Polignac number, because 13335201103409 - 220 = 13335200054833 is a prime.
It is a super-2 number, since 2×133352011034092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13335201103489) 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, 6667600551704 + 6667600551705.
It is an arithmetic number, because the mean of its divisors is an integer number (6667600551705).
Almost surely, 213335201103409 is an apocalyptic number.
It is an amenable number.
13335201103409 is a deficient number, since it is larger than the sum of its proper divisors (1).
13335201103409 is an equidigital number, since it uses as much as digits as its factorization.
13335201103409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 35.
The spelling of 13335201103409 in words is "thirteen trillion, three hundred thirty-five billion, two hundred one million, one hundred three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •