Base | Representation |
---|---|
bin | 1110101101101011100… |
… | …00011111000111010101 |
3 | 1210022221101101102200100 |
4 | 13112311300133013111 |
5 | 31240342000410320 |
6 | 1024130141204313 |
7 | 51345155566650 |
oct | 7266560370725 |
9 | 1708841342610 |
10 | 505560560085 |
11 | 1854528355a9 |
12 | 81b93260699 |
13 | 3889c176609 |
14 | 1a67d922897 |
15 | d23ddb6790 |
hex | 75b5c1f1d5 |
505560560085 has 48 divisors (see below), whose sum is σ = 1003498704000. Its totient is φ = 230650174080.
The previous prime is 505560560039. The next prime is 505560560149. The reversal of 505560560085 is 580065065505.
505560560085 is a `hidden beast` number, since 5 + 0 + 5 + 5 + 6 + 0 + 560 + 0 + 85 = 666.
It is not a de Polignac number, because 505560560085 - 29 = 505560559573 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 505560560085.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1450986 + ... + 1765355.
It is an arithmetic number, because the mean of its divisors is an integer number (20906223000).
Almost surely, 2505560560085 is an apocalyptic number.
It is an amenable number.
505560560085 is a deficient number, since it is larger than the sum of its proper divisors (497938143915).
505560560085 is a wasteful number, since it uses less digits than its factorization.
505560560085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3216858 (or 3216855 counting only the distinct ones).
The product of its (nonzero) digits is 900000, while the sum is 45.
The spelling of 505560560085 in words is "five hundred five billion, five hundred sixty million, five hundred sixty thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •