Base | Representation |
---|---|
bin | 11110000110011… |
… | …101111100101101 |
3 | 1022012021021020122 |
4 | 132012131330231 |
5 | 2013240341023 |
6 | 122040054325 |
7 | 15341350142 |
oct | 3606357455 |
9 | 1265237218 |
10 | 505012013 |
11 | 23a080000 |
12 | 1211643a5 |
13 | 8081b49c |
14 | 4b0dc3c9 |
15 | 2e5082c8 |
hex | 1e19df2d |
505012013 has 20 divisors (see below), whose sum is σ = 588476700. Its totient is φ = 431882880.
The previous prime is 505011953. The next prime is 505012021. The reversal of 505012013 is 310210505.
It can be written as a sum of positive squares in 2 ways, for example, as 463885444 + 41126569 = 21538^2 + 6413^2 .
It is not a de Polignac number, because 505012013 - 212 = 505007917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505011982 and 505012000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505015013) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 247883 + ... + 249911.
It is an arithmetic number, because the mean of its divisors is an integer number (29423835).
Almost surely, 2505012013 is an apocalyptic number.
It is an amenable number.
505012013 is a deficient number, since it is larger than the sum of its proper divisors (83464687).
505012013 is an equidigital number, since it uses as much as digits as its factorization.
505012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2090 (or 2057 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 505012013 is about 22472.4723383966. The cubic root of 505012013 is about 796.3437385853.
Adding to 505012013 its reverse (310210505), we get a palindrome (815222518).
The spelling of 505012013 in words is "five hundred five million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •