Base | Representation |
---|---|
bin | 101000000100000011011… |
… | …0010101010101111110101 |
3 | 201111101121212102100220121 |
4 | 1100020012302222233311 |
5 | 1210203311034102221 |
6 | 15413313012331541 |
7 | 1105546206631036 |
oct | 120100662525765 |
9 | 21441555370817 |
10 | 5506262019061 |
11 | 18332133a8621 |
12 | 74b198013bb1 |
13 | 30c31366b05b |
14 | 15070c502a8d |
15 | 9836ce97a41 |
hex | 50206caabf5 |
5506262019061 has 4 divisors (see below), whose sum is σ = 5508270873324. Its totient is φ = 5504253164800.
The previous prime is 5506262019023. The next prime is 5506262019067. The reversal of 5506262019061 is 1609102626055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3240954070225 + 2265307948836 = 1800265^2 + 1505094^2 .
It is a cyclic number.
It is not a de Polignac number, because 5506262019061 - 215 = 5506261986293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5506262018999 and 5506262019017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5506262019067) 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, 1004423020 + ... + 1004428501.
It is an arithmetic number, because the mean of its divisors is an integer number (1377067718331).
Almost surely, 25506262019061 is an apocalyptic number.
It is an amenable number.
5506262019061 is a deficient number, since it is larger than the sum of its proper divisors (2008854263).
5506262019061 is a wasteful number, since it uses less digits than its factorization.
5506262019061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2008854262.
The product of its (nonzero) digits is 194400, while the sum is 43.
The spelling of 5506262019061 in words is "five trillion, five hundred six billion, two hundred sixty-two million, nineteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •