Base | Representation |
---|---|
bin | 11110000111011… |
… | …000100010101101 |
3 | 1022012201110110112 |
4 | 132013120202231 |
5 | 2013321031023 |
6 | 122045145405 |
7 | 15343366640 |
oct | 3607304255 |
9 | 1265643415 |
10 | 505252013 |
11 | 23a224352 |
12 | 12125b265 |
13 | 808a37b6 |
14 | 4b161a57 |
15 | 2e554478 |
hex | 1e1d88ad |
505252013 has 4 divisors (see below), whose sum is σ = 577430880. Its totient is φ = 433073148.
The previous prime is 505252003. The next prime is 505252037. The reversal of 505252013 is 310252505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310252505 = 5 ⋅62050501.
It is a cyclic number.
It is not a de Polignac number, because 505252013 - 216 = 505186477 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 505252013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505252003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36089423 + ... + 36089436.
It is an arithmetic number, because the mean of its divisors is an integer number (144357720).
Almost surely, 2505252013 is an apocalyptic number.
It is an amenable number.
505252013 is a deficient number, since it is larger than the sum of its proper divisors (72178867).
505252013 is an equidigital number, since it uses as much as digits as its factorization.
505252013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72178866.
The product of its (nonzero) digits is 1500, while the sum is 23.
The square root of 505252013 is about 22477.8115705244. The cubic root of 505252013 is about 796.4698690694.
The spelling of 505252013 in words is "five hundred five million, two hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •