Base | Representation |
---|---|
bin | 1110101100101001010… |
… | …01001101100011001001 |
3 | 1210021111200000022101010 |
4 | 13112110221031203021 |
5 | 31233222240130001 |
6 | 1023555053514133 |
7 | 51325331500560 |
oct | 7262451154311 |
9 | 1707450008333 |
10 | 505005005001 |
11 | 185198183872 |
12 | 81a591a2949 |
13 | 3881103c7b3 |
14 | 1a629c28bd7 |
15 | d20a2278d6 |
hex | 7594a4d8c9 |
505005005001 has 32 divisors (see below), whose sum is σ = 773090053120. Its totient is φ = 287242376256.
The previous prime is 505005004957. The next prime is 505005005017. The reversal of 505005005001 is 100500500505.
It is not a de Polignac number, because 505005005001 - 29 = 505005004489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (505005004001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4711335 + ... + 4817331.
It is an arithmetic number, because the mean of its divisors is an integer number (24159064160).
Almost surely, 2505005005001 is an apocalyptic number.
It is an amenable number.
505005005001 is a deficient number, since it is larger than the sum of its proper divisors (268085048119).
505005005001 is a wasteful number, since it uses less digits than its factorization.
505005005001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107053.
The product of its (nonzero) digits is 625, while the sum is 21.
Adding to 505005005001 its reverse (100500500505), we get a palindrome (605505505506).
The spelling of 505005005001 in words is "five hundred five billion, five million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •