Base | Representation |
---|---|
bin | 11110000111100… |
… | …111011110110001 |
3 | 1022012211120101202 |
4 | 132013213132301 |
5 | 2013330010301 |
6 | 122050340545 |
7 | 15344043221 |
oct | 3607473661 |
9 | 1265746352 |
10 | 505313201 |
11 | 23a266318 |
12 | 12128a755 |
13 | 808c55c3 |
14 | 4b17a081 |
15 | 2e56766b |
hex | 1e1e77b1 |
505313201 has 4 divisors (see below), whose sum is σ = 510316404. Its totient is φ = 500310000.
The previous prime is 505313191. The next prime is 505313239. The reversal of 505313201 is 102313505.
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 264908176 + 240405025 = 16276^2 + 15505^2 .
It is a cyclic number.
It is not a de Polignac number, because 505313201 - 210 = 505312177 is a prime.
It is a super-2 number, since 2×5053132012 = 510682862209732802, 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 (505313251) 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, 2501450 + ... + 2501651.
It is an arithmetic number, because the mean of its divisors is an integer number (127579101).
Almost surely, 2505313201 is an apocalyptic number.
It is an amenable number.
505313201 is a deficient number, since it is larger than the sum of its proper divisors (5003203).
505313201 is a wasteful number, since it uses less digits than its factorization.
505313201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5003202.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 505313201 is about 22479.1726048803. The cubic root of 505313201 is about 796.5020196464.
Adding to 505313201 its reverse (102313505), we get a palindrome (607626706).
The spelling of 505313201 in words is "five hundred five million, three hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •