Base | Representation |
---|---|
bin | 11110001010011… |
… | …011011111001001 |
3 | 1022021020000210022 |
4 | 132022123133021 |
5 | 2014022104010 |
6 | 122114230225 |
7 | 15353233622 |
oct | 3612333711 |
9 | 1267200708 |
10 | 506050505 |
11 | 23a71a264 |
12 | 121585375 |
13 | 80ac308c |
14 | 4b2cca49 |
15 | 2e660d55 |
hex | 1e29b7c9 |
506050505 has 4 divisors (see below), whose sum is σ = 607260612. Its totient is φ = 404840400.
The previous prime is 506050487. The next prime is 506050507. The reversal of 506050505 is 505050605.
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 124902976 + 381147529 = 11176^2 + 19523^2 .
It is not a de Polignac number, because 506050505 - 224 = 489273289 is a prime.
It is a super-2 number, since 2×5060505052 = 512174227221510050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (506050507) 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 3 ways as a sum of consecutive naturals, for example, 50605046 + ... + 50605055.
It is an arithmetic number, because the mean of its divisors is an integer number (151815153).
Almost surely, 2506050505 is an apocalyptic number.
It is an amenable number.
506050505 is a deficient number, since it is larger than the sum of its proper divisors (101210107).
506050505 is a wasteful number, since it uses less digits than its factorization.
506050505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101210106.
The product of its (nonzero) digits is 3750, while the sum is 26.
The square root of 506050505 is about 22495.5663409482. The cubic root of 506050505 is about 796.8892242085.
The spelling of 506050505 in words is "five hundred six million, fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •