Base | Representation |
---|---|
bin | 10110110010010000110111… |
… | …00010101100101101100001 |
3 | 20120102001011222011001210202 |
4 | 23121020123202230231201 |
5 | 23031412131420243001 |
6 | 254322101104034545 |
7 | 13361002152352463 |
oct | 1331103342545541 |
9 | 216361158131722 |
10 | 50105550556001 |
11 | 14a68710049056 |
12 | 575295b602a55 |
13 | 21c5c19167885 |
14 | c5319b8c2133 |
15 | 5bd56130396b |
hex | 2d921b8acb61 |
50105550556001 has 4 divisors (see below), whose sum is σ = 52284052754112. Its totient is φ = 47927048357892.
The previous prime is 50105550555947. The next prime is 50105550556013. The reversal of 50105550556001 is 10065505550105.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50105550556001 - 234 = 50088370686817 is a prime.
It is a super-2 number, since 2×501055505560012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50105550556051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1089251099021 + ... + 1089251099066.
It is an arithmetic number, because the mean of its divisors is an integer number (13071013188528).
Almost surely, 250105550556001 is an apocalyptic number.
It is an amenable number.
50105550556001 is a deficient number, since it is larger than the sum of its proper divisors (2178502198111).
50105550556001 is a wasteful number, since it uses less digits than its factorization.
50105550556001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2178502198110.
The product of its (nonzero) digits is 93750, while the sum is 38.
The spelling of 50105550556001 in words is "fifty trillion, one hundred five billion, five hundred fifty million, five hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •