Base | Representation |
---|---|
bin | 101000001010101010110… |
… | …1010010110011001111101 |
3 | 201112202022001111201111002 |
4 | 1100111111222112121331 |
5 | 1210421410323444131 |
6 | 15424022521540045 |
7 | 1106561252650526 |
oct | 120252552263175 |
9 | 21482261451432 |
10 | 5520470140541 |
11 | 1839244526584 |
12 | 751aa2344625 |
13 | 310769118a25 |
14 | 1512994b384d |
15 | 989004db6cb |
hex | 50555a9667d |
5520470140541 has 8 divisors (see below), whose sum is σ = 5791265424000. Its totient is φ = 5255037140080.
The previous prime is 5520470140531. The next prime is 5520470140597. The reversal of 5520470140541 is 1450410740255.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5520470140541 - 26 = 5520470140477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5520470140495 and 5520470140504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5520470140531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1340568641 + ... + 1340572758.
It is an arithmetic number, because the mean of its divisors is an integer number (723908178000).
Almost surely, 25520470140541 is an apocalyptic number.
It is an amenable number.
5520470140541 is a deficient number, since it is larger than the sum of its proper divisors (270795283459).
5520470140541 is a wasteful number, since it uses less digits than its factorization.
5520470140541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2681141499.
The product of its (nonzero) digits is 112000, while the sum is 38.
Adding to 5520470140541 its reverse (1450410740255), we get a palindrome (6970880880796).
The spelling of 5520470140541 in words is "five trillion, five hundred twenty billion, four hundred seventy million, one hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •