Base | Representation |
---|---|
bin | 101111100011001011… |
… | …011010100001010101 |
3 | 11212210011222121021202 |
4 | 233203023122201111 |
5 | 1314030322414001 |
6 | 35242124322245 |
7 | 3455134232225 |
oct | 574313324125 |
9 | 155704877252 |
10 | 51056060501 |
11 | 1a71a8a6a26 |
12 | 9a8a6a3385 |
13 | 4a787a79b4 |
14 | 2684ab2085 |
15 | 14dc44b96b |
hex | be32da855 |
51056060501 has 8 divisors (see below), whose sum is σ = 54053879520. Its totient is φ = 48089307312.
The previous prime is 51056060479. The next prime is 51056060533. The reversal of 51056060501 is 10506065015.
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 51056060501 - 222 = 51051866197 is a prime.
It is a super-3 number, since 3×510560605013 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51056060801) 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, 7763075 + ... + 7769648.
It is an arithmetic number, because the mean of its divisors is an integer number (6756734940).
Almost surely, 251056060501 is an apocalyptic number.
It is an amenable number.
51056060501 is a deficient number, since it is larger than the sum of its proper divisors (2997819019).
51056060501 is a wasteful number, since it uses less digits than its factorization.
51056060501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15532915.
The product of its (nonzero) digits is 4500, while the sum is 29.
It can be divided in two parts, 5105 and 6060501, that added together give a palindrome (6065606).
The spelling of 51056060501 in words is "fifty-one billion, fifty-six million, sixty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •