Base | Representation |
---|---|
bin | 1100001000010001101010… |
… | …0000011001000110110101 |
3 | 1202012221100221102220010121 |
4 | 3002010122200121012311 |
5 | 3222000234421400031 |
6 | 44210341525451541 |
7 | 2544342252625324 |
oct | 302043240310665 |
9 | 52187327386117 |
10 | 13336318153141 |
11 | 428199aa13a95 |
12 | 15b4801b70bb1 |
13 | 7597bcb30569 |
14 | 3416a475c0bb |
15 | 181d954a0011 |
hex | c211a8191b5 |
13336318153141 has 4 divisors (see below), whose sum is σ = 13336364044384. Its totient is φ = 13336272261900.
The previous prime is 13336318153097. The next prime is 13336318153153. The reversal of 13336318153141 is 14135181363331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13336318153141 - 225 = 13336284598709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13336318153181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22506915 + ... + 23091856.
It is an arithmetic number, because the mean of its divisors is an integer number (3334091011096).
Almost surely, 213336318153141 is an apocalyptic number.
It is an amenable number.
13336318153141 is a deficient number, since it is larger than the sum of its proper divisors (45891243).
13336318153141 is an equidigital number, since it uses as much as digits as its factorization.
13336318153141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45891242.
The product of its digits is 233280, while the sum is 43.
The spelling of 13336318153141 in words is "thirteen trillion, three hundred thirty-six billion, three hundred eighteen million, one hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •