Base | Representation |
---|---|
bin | 1110101100101111111… |
… | …10110101100010111101 |
3 | 1210021122120101102121201 |
4 | 13112113332311202331 |
5 | 31233331104134001 |
6 | 1024004414055501 |
7 | 51326611466413 |
oct | 7262776654275 |
9 | 1707576342551 |
10 | 505061005501 |
11 | 185216852878 |
12 | 81a73aaa591 |
13 | 3881c8191a0 |
14 | 1a6334452b3 |
15 | d2100da501 |
hex | 7597fb58bd |
505061005501 has 8 divisors (see below), whose sum is σ = 543917376800. Its totient is φ = 466205423472.
The previous prime is 505061005457. The next prime is 505061005507. The reversal of 505061005501 is 105500160505.
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 505061005501 - 217 = 505060874429 is a prime.
It is a super-3 number, since 3×5050610055013 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 505061005501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505061005507) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2345050 + ... + 2551348.
It is an arithmetic number, because the mean of its divisors is an integer number (67989672100).
Almost surely, 2505061005501 is an apocalyptic number.
It is an amenable number.
505061005501 is a deficient number, since it is larger than the sum of its proper divisors (38856371299).
505061005501 is a wasteful number, since it uses less digits than its factorization.
505061005501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 394635.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 505061005501 in words is "five hundred five billion, sixty-one million, five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •