Base | Representation |
---|---|
bin | 1110101110100001001… |
… | …01010010100110001101 |
3 | 1210101002202020100011222 |
4 | 13113100211102212031 |
5 | 31242302204010221 |
6 | 1024242535253125 |
7 | 51362262135005 |
oct | 7272045224615 |
9 | 1711082210158 |
10 | 506010610061 |
11 | 185663885830 |
12 | 82099b1a1a5 |
13 | 3894148cc88 |
14 | 1a6c35d5005 |
15 | d2686649ab |
hex | 75d095298d |
506010610061 has 8 divisors (see below), whose sum is σ = 576012078144. Its totient is φ = 440009225920.
The previous prime is 506010610037. The next prime is 506010610109. The reversal of 506010610061 is 160016010605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 506010610061 - 230 = 504936868237 is a prime.
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 506010610061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506010610361) 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, 1000020716 + ... + 1000021221.
It is an arithmetic number, because the mean of its divisors is an integer number (72001509768).
Almost surely, 2506010610061 is an apocalyptic number.
It is an amenable number.
506010610061 is a deficient number, since it is larger than the sum of its proper divisors (70001468083).
506010610061 is a wasteful number, since it uses less digits than its factorization.
506010610061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000041971.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 506010610061 its reverse (160016010605), we get a palindrome (666026620666).
The spelling of 506010610061 in words is "five hundred six billion, ten million, six hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •