Base | Representation |
---|---|
bin | 101000000111010000011… |
… | …1101101001010101111101 |
3 | 201112001101110020122011211 |
4 | 1100032200331221111331 |
5 | 1210311404222233303 |
6 | 15420411515444421 |
7 | 1106211560005252 |
oct | 120164075512575 |
9 | 21461343218154 |
10 | 5513143555453 |
11 | 183612489a786 |
12 | 750598756711 |
13 | 30cb6c267491 |
14 | 150ba2423429 |
15 | 986221b166d |
hex | 503a0f6957d |
5513143555453 has 4 divisors (see below), whose sum is σ = 5803309005760. Its totient is φ = 5222978105148.
The previous prime is 5513143555441. The next prime is 5513143555481. The reversal of 5513143555453 is 3545553413155.
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 5513143555453 - 233 = 5504553620861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5513143555397 and 5513143555406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5513143558453) 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, 145082725125 + ... + 145082725162.
It is an arithmetic number, because the mean of its divisors is an integer number (1450827251440).
Almost surely, 25513143555453 is an apocalyptic number.
It is an amenable number.
5513143555453 is a deficient number, since it is larger than the sum of its proper divisors (290165450307).
5513143555453 is a wasteful number, since it uses less digits than its factorization.
5513143555453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290165450306.
The product of its digits is 6750000, while the sum is 49.
The spelling of 5513143555453 in words is "five trillion, five hundred thirteen billion, one hundred forty-three million, five hundred fifty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •