Base | Representation |
---|---|
bin | 11110001000100… |
… | …011110000101001 |
3 | 1022020022010002100 |
4 | 132020203300221 |
5 | 2013410410410 |
6 | 122055524013 |
7 | 15346122111 |
oct | 3610436051 |
9 | 1266263070 |
10 | 505560105 |
11 | 23a414876 |
12 | 121389609 |
13 | 80980abb |
14 | 4b202041 |
15 | 2e5b58c0 |
hex | 1e223c29 |
505560105 has 24 divisors (see below), whose sum is σ = 887402880. Its totient is φ = 266217120.
The previous prime is 505560101. The next prime is 505560109. The reversal of 505560105 is 501065505.
505560105 is a `hidden beast` number, since 5 + 0 + 55 + 601 + 0 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (505560101) and next prime (505560109).
It is not a de Polignac number, because 505560105 - 22 = 505560101 is a prime.
It is a super-2 number, since 2×5055601052 = 511182039535222050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (505560101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67551 + ... + 74660.
It is an arithmetic number, because the mean of its divisors is an integer number (36975120).
Almost surely, 2505560105 is an apocalyptic number.
It is an amenable number.
505560105 is a deficient number, since it is larger than the sum of its proper divisors (381842775).
505560105 is a wasteful number, since it uses less digits than its factorization.
505560105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142301 (or 142298 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 505560105 is about 22484.6637733367. The cubic root of 505560105 is about 796.6317263396.
The spelling of 505560105 in words is "five hundred five million, five hundred sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •