Base | Representation |
---|---|
bin | 1100010101011110001010… |
… | …0110111110101010001101 |
3 | 1210000121111201221221001011 |
4 | 3011113202212332222031 |
5 | 3234204022441404123 |
6 | 44502432404245221 |
7 | 2566616056415653 |
oct | 305274246765215 |
9 | 53017451857034 |
10 | 13563013622413 |
11 | 435a05066a392 |
12 | 16307299a0811 |
13 | 774ca9a071a8 |
14 | 34c64c04cdd3 |
15 | 187c123a2e0d |
hex | c55e29bea8d |
13563013622413 has 4 divisors (see below), whose sum is σ = 13563468741088. Its totient is φ = 13562558503740.
The previous prime is 13563013622273. The next prime is 13563013622441. The reversal of 13563013622413 is 31422631036531.
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 13563013622413 - 213 = 13563013614221 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 (13563013629413) 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, 227514633 + ... + 227574238.
It is an arithmetic number, because the mean of its divisors is an integer number (3390867185272).
Almost surely, 213563013622413 is an apocalyptic number.
It is an amenable number.
13563013622413 is a deficient number, since it is larger than the sum of its proper divisors (455118675).
13563013622413 is an equidigital number, since it uses as much as digits as its factorization.
13563013622413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 455118674.
The product of its (nonzero) digits is 233280, while the sum is 40.
Adding to 13563013622413 its reverse (31422631036531), we get a palindrome (44985644658944).
The spelling of 13563013622413 in words is "thirteen trillion, five hundred sixty-three billion, thirteen million, six hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •