Base | Representation |
---|---|
bin | 11110001000111… |
… | …101101111001001 |
3 | 1022020111112001002 |
4 | 132020331233021 |
5 | 2013422312010 |
6 | 122102104345 |
7 | 15350044241 |
oct | 3610755711 |
9 | 1266445032 |
10 | 505666505 |
11 | 23a487803 |
12 | 12141b0b5 |
13 | 809ba366 |
14 | 4b22cb21 |
15 | 2e5d71a5 |
hex | 1e23dbc9 |
505666505 has 8 divisors (see below), whose sum is σ = 606942024. Its totient is φ = 404438400.
The previous prime is 505666501. The next prime is 505666507.
It is a happy number.
505666505 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 11182336 + 494484169 = 3344^2 + 22237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 505666505 - 22 = 505666501 is a prime.
It is a super-2 number, since 2×5056665052 = 511397228557830050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505666501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18845 + ... + 36965.
It is an arithmetic number, because the mean of its divisors is an integer number (75867753).
Almost surely, 2505666505 is an apocalyptic number.
It is an amenable number.
505666505 is a deficient number, since it is larger than the sum of its proper divisors (101275519).
505666505 is a wasteful number, since it uses less digits than its factorization.
505666505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23707.
The product of its (nonzero) digits is 135000, while the sum is 38.
The square root of 505666505 is about 22487.0297060328. The cubic root of 505666505 is about 796.6876086961.
The spelling of 505666505 in words is "five hundred five million, six hundred sixty-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •