Base | Representation |
---|---|
bin | 101111011111110101… |
… | …110000000110000111 |
3 | 11212122021120222101210 |
4 | 233133311300012013 |
5 | 1313422003100210 |
6 | 35232404022503 |
7 | 3453554162403 |
oct | 573765600607 |
9 | 155567528353 |
10 | 51000050055 |
11 | 1a6a12204a9 |
12 | 9a73991a33 |
13 | 4a69cc6916 |
14 | 267b492103 |
15 | 14d7585e20 |
hex | bdfd70187 |
51000050055 has 32 divisors (see below), whose sum is σ = 84594032640. Its totient is φ = 26209578240.
The previous prime is 51000050027. The next prime is 51000050069. The reversal of 51000050055 is 55005000015.
It is not a de Polignac number, because 51000050055 - 27 = 51000049927 is a prime.
It is a super-2 number, since 2×510000500552 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 127015 + ... + 343704.
It is an arithmetic number, because the mean of its divisors is an integer number (2643563520).
Almost surely, 251000050055 is an apocalyptic number.
51000050055 is a deficient number, since it is larger than the sum of its proper divisors (33593982585).
51000050055 is a wasteful number, since it uses less digits than its factorization.
51000050055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470991.
The product of its (nonzero) digits is 625, while the sum is 21.
The spelling of 51000050055 in words is "fifty-one billion, fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •