Base | Representation |
---|---|
bin | 1110101100101001111… |
… | …00010001010010100101 |
3 | 1210021112000102010200101 |
4 | 13112110330101102211 |
5 | 31233230030013221 |
6 | 1023555352544101 |
7 | 51325422116416 |
oct | 7262474212245 |
9 | 1707460363611 |
10 | 505010001061 |
11 | 18519aa86445 |
12 | 81a5a9b2031 |
13 | 3881209b847 |
14 | 1a62a76980d |
15 | d20a8b2d91 |
hex | 7594f114a5 |
505010001061 has 8 divisors (see below), whose sum is σ = 511894822400. Its totient is φ = 498137487120.
The previous prime is 505010001017. The next prime is 505010001071. The reversal of 505010001061 is 160100010505.
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 505010001061 - 27 = 505010000933 is a prime.
It is a super-2 number, since 2×5050100010612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505010001071) 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 7 ways as a sum of consecutive naturals, for example, 2994210 + ... + 3158371.
It is an arithmetic number, because the mean of its divisors is an integer number (63986852800).
Almost surely, 2505010001061 is an apocalyptic number.
It is an amenable number.
505010001061 is a deficient number, since it is larger than the sum of its proper divisors (6884821339).
505010001061 is a wasteful number, since it uses less digits than its factorization.
505010001061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6153699.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 505010001061 its reverse (160100010505), we get a palindrome (665110011566).
The spelling of 505010001061 in words is "five hundred five billion, ten million, one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •