Base | Representation |
---|---|
bin | 1100011010101101100100… |
… | …1101101001001101101001 |
3 | 1210100012220112212000022112 |
4 | 3012223121031221031221 |
5 | 3242142421334033431 |
6 | 45012042534532105 |
7 | 2606254212510023 |
oct | 306533115511551 |
9 | 53305815760275 |
10 | 13653050299241 |
11 | 4394253a61301 |
12 | 1646076b07035 |
13 | 7806282cb522 |
14 | 352b4db77013 |
15 | 18a231a76c2b |
hex | c6ad9369369 |
13653050299241 has 2 divisors, whose sum is σ = 13653050299242. Its totient is φ = 13653050299240.
The previous prime is 13653050299181. The next prime is 13653050299267. The reversal of 13653050299241 is 14299205035631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8454632059225 + 5198418240016 = 2907685^2 + 2280004^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13653050299241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13653050299241.
It is not a weakly prime, because it can be changed into another prime (13653050293241) 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, 6826525149620 + 6826525149621.
It is an arithmetic number, because the mean of its divisors is an integer number (6826525149621).
Almost surely, 213653050299241 is an apocalyptic number.
It is an amenable number.
13653050299241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13653050299241 is an equidigital number, since it uses as much as digits as its factorization.
13653050299241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1749600, while the sum is 50.
The spelling of 13653050299241 in words is "thirteen trillion, six hundred fifty-three billion, fifty million, two hundred ninety-nine thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •