Base | Representation |
---|---|
bin | 11110000111011… |
… | …001000000110001 |
3 | 1022012201120002210 |
4 | 132013121000301 |
5 | 2013321111222 |
6 | 122045202333 |
7 | 15343405356 |
oct | 3607310061 |
9 | 1265646083 |
10 | 505253937 |
11 | 23a225841 |
12 | 1212603a9 |
13 | 808a4636 |
14 | 4b16262d |
15 | 2e554d0c |
hex | 1e1d9031 |
505253937 has 8 divisors (see below), whose sum is σ = 675798336. Its totient is φ = 335772752.
The previous prime is 505253933. The next prime is 505253941. The reversal of 505253937 is 739352505.
It is an interprime number because it is at equal distance from previous prime (505253933) and next prime (505253941).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 505253937 - 22 = 505253933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 505253895 and 505253904.
It is not an unprimeable number, because it can be changed into a prime (505253933) 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 7 ways as a sum of consecutive naturals, for example, 264693 + ... + 266594.
It is an arithmetic number, because the mean of its divisors is an integer number (84474792).
Almost surely, 2505253937 is an apocalyptic number.
It is an amenable number.
505253937 is a deficient number, since it is larger than the sum of its proper divisors (170544399).
505253937 is a wasteful number, since it uses less digits than its factorization.
505253937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531607.
The product of its (nonzero) digits is 141750, while the sum is 39.
The square root of 505253937 is about 22477.8543682443. The cubic root of 505253937 is about 796.4708800541.
The spelling of 505253937 in words is "five hundred five million, two hundred fifty-three thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •