Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …01011000010001000000001 |
3 | 20200120121100000200221122102 |
4 | 23212021331223002020001 |
5 | 23141043111311334401 |
6 | 300245155042320145 |
7 | 13512445114121435 |
oct | 1346117553021001 |
9 | 220517300627572 |
10 | 51000550105601 |
11 | 15283236a53508 |
12 | 58782b9059055 |
13 | 225c43c968095 |
14 | c84622b2a9c5 |
15 | 5d699483a56b |
hex | 2e627dac2201 |
51000550105601 has 8 divisors (see below), whose sum is σ = 54009483279840. Its totient is φ = 47992605910848.
The previous prime is 51000550105481. The next prime is 51000550105627. The reversal of 51000550105601 is 10650105500015.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51000550105601 - 222 = 51000545911297 is a prime.
It is a super-2 number, since 2×510005501056012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51000550105691) 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, 247138691 + ... + 247344968.
It is an arithmetic number, because the mean of its divisors is an integer number (6751185409980).
Almost surely, 251000550105601 is an apocalyptic number.
It is an amenable number.
51000550105601 is a deficient number, since it is larger than the sum of its proper divisors (3008933174239).
51000550105601 is a wasteful number, since it uses less digits than its factorization.
51000550105601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494489743.
The product of its (nonzero) digits is 3750, while the sum is 29.
Adding to 51000550105601 its reverse (10650105500015), we get a palindrome (61650655605616).
The spelling of 51000550105601 in words is "fifty-one trillion, five hundred fifty million, one hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •