Base | Representation |
---|---|
bin | 11110001000010… |
… | …101001001010101 |
3 | 1022020012001222022 |
4 | 132020111021111 |
5 | 2013402001440 |
6 | 122054342525 |
7 | 15345452435 |
oct | 3610251125 |
9 | 1266161868 |
10 | 505500245 |
11 | 23a3838a8 |
12 | 12135aa45 |
13 | 8095c793 |
14 | 4b1c82c5 |
15 | 2e5a2cb5 |
hex | 1e215255 |
505500245 has 4 divisors (see below), whose sum is σ = 606600300. Its totient is φ = 404400192.
The previous prime is 505500241. The next prime is 505500269. The reversal of 505500245 is 542005505.
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 147306769 + 358193476 = 12137^2 + 18926^2 .
It is a cyclic number.
It is not a de Polignac number, because 505500245 - 22 = 505500241 is a prime.
It is a super-3 number, since 3×5055002453 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505500241) 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 3 ways as a sum of consecutive naturals, for example, 50550020 + ... + 50550029.
It is an arithmetic number, because the mean of its divisors is an integer number (151650075).
Almost surely, 2505500245 is an apocalyptic number.
It is an amenable number.
505500245 is a deficient number, since it is larger than the sum of its proper divisors (101100055).
505500245 is a wasteful number, since it uses less digits than its factorization.
505500245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101100054.
The product of its (nonzero) digits is 5000, while the sum is 26.
The square root of 505500245 is about 22483.3326043983. The cubic root of 505500245 is about 796.6002838155.
The spelling of 505500245 in words is "five hundred five million, five hundred thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •