Base | Representation |
---|---|
bin | 1110101110100000000… |
… | …00110101111100001101 |
3 | 1210101002002020220210101 |
4 | 13113100000311330031 |
5 | 31242242232234001 |
6 | 1024241554411101 |
7 | 51362115002104 |
oct | 7272000657415 |
9 | 1711062226711 |
10 | 506001055501 |
11 | 18565944a2a7 |
12 | 82096890a91 |
13 | 3893c4c60a6 |
14 | 1a6c222903b |
15 | d2678c8a01 |
hex | 75d0035f0d |
506001055501 has 8 divisors (see below), whose sum is σ = 517992668864. Its totient is φ = 494019630720.
The previous prime is 506001055499. The next prime is 506001055517. The reversal of 506001055501 is 105550100605.
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 506001055501 - 21 = 506001055499 is a prime.
It is a super-2 number, since 2×5060010555012 (a number of 24 digits) contains 22 as substring.
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 506001055501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506001056501) 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, 2446596 + ... + 2645341.
It is an arithmetic number, because the mean of its divisors is an integer number (64749083608).
Almost surely, 2506001055501 is an apocalyptic number.
It is an amenable number.
506001055501 is a deficient number, since it is larger than the sum of its proper divisors (11991613363).
506001055501 is a wasteful number, since it uses less digits than its factorization.
506001055501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5094291.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 506001055501 in words is "five hundred six billion, one million, fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •