Base | Representation |
---|---|
bin | 1110101100101111111… |
… | …10110101100011100101 |
3 | 1210021122120101102200012 |
4 | 13112113332311203211 |
5 | 31233331104134131 |
6 | 1024004414100005 |
7 | 51326611466501 |
oct | 7262776654345 |
9 | 1707576342605 |
10 | 505061005541 |
11 | 185216852904 |
12 | 81a73aaa605 |
13 | 3881c819201 |
14 | 1a633445301 |
15 | d2100da52b |
hex | 7597fb58e5 |
505061005541 has 4 divisors (see below), whose sum is σ = 505062511500. Its totient is φ = 505059499584.
The previous prime is 505061005511. The next prime is 505061005549. The reversal of 505061005541 is 145500160505.
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 430670625025 + 74390380516 = 656255^2 + 272746^2 .
It is a cyclic number.
It is not a de Polignac number, because 505061005541 - 226 = 504993896677 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 505061005498 and 505061005507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505061005549) 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, 3245 + ... + 1005053.
It is an arithmetic number, because the mean of its divisors is an integer number (126265627875).
Almost surely, 2505061005541 is an apocalyptic number.
It is an amenable number.
505061005541 is a deficient number, since it is larger than the sum of its proper divisors (1505959).
505061005541 is a wasteful number, since it uses less digits than its factorization.
505061005541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1505958.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 505061005541 in words is "five hundred five billion, sixty-one million, five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •