Base | Representation |
---|---|
bin | 1100011011001110111011… |
… | …0100001100101101101101 |
3 | 1210101002000110022011122222 |
4 | 3012303232310030231231 |
5 | 3242314240140143003 |
6 | 45020123135045125 |
7 | 2610022106364521 |
oct | 306635664145555 |
9 | 53332013264588 |
10 | 13662002662253 |
11 | 4398028376120 |
12 | 16479550707a5 |
13 | 781423c3cb4a |
14 | 35335cb0bd81 |
15 | 18a5a7993c38 |
hex | c6ceed0cb6d |
13662002662253 has 4 divisors (see below), whose sum is σ = 14904002904288. Its totient is φ = 12420002420220.
The previous prime is 13662002662219. The next prime is 13662002662267. The reversal of 13662002662253 is 35226620026631.
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 13662002662253 - 220 = 13662001613677 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 (13662002667253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 621000121001 + ... + 621000121022.
It is an arithmetic number, because the mean of its divisors is an integer number (3726000726072).
Almost surely, 213662002662253 is an apocalyptic number.
It is an amenable number.
13662002662253 is a deficient number, since it is larger than the sum of its proper divisors (1242000242035).
13662002662253 is a wasteful number, since it uses less digits than its factorization.
13662002662253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242000242034.
The product of its (nonzero) digits is 933120, while the sum is 44.
Adding to 13662002662253 its reverse (35226620026631), we get a palindrome (48888622688884).
The spelling of 13662002662253 in words is "thirteen trillion, six hundred sixty-two billion, two million, six hundred sixty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •