Base | Representation |
---|---|
bin | 10110110010011001010110… |
… | …00100100011010101111101 |
3 | 20120102110221110010110002012 |
4 | 23121030223010203111331 |
5 | 23032000444122243221 |
6 | 254324133120141005 |
7 | 13361223066435662 |
oct | 1331145304432575 |
9 | 216373843113065 |
10 | 50110106056061 |
11 | 14a6a638556737 |
12 | 5753811167765 |
13 | 21c6493ba403c |
14 | c534b0917a69 |
15 | 5bd72b20665b |
hex | 2d932b12357d |
50110106056061 has 8 divisors (see below), whose sum is σ = 52318736988864. Its totient is φ = 47903969345760.
The previous prime is 50110106056027. The next prime is 50110106056103. The reversal of 50110106056061 is 16065060101105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50110106056061 is a prime.
It is a super-2 number, since 2×501101060560612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50110106056261) 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, 623514560 + ... + 623594921.
It is an arithmetic number, because the mean of its divisors is an integer number (6539842123608).
Almost surely, 250110106056061 is an apocalyptic number.
It is an amenable number.
50110106056061 is a deficient number, since it is larger than the sum of its proper divisors (2208630932803).
50110106056061 is a wasteful number, since it uses less digits than its factorization.
50110106056061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1247111251.
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 50110106056061 its reverse (16065060101105), we get a palindrome (66175166157166).
The spelling of 50110106056061 in words is "fifty trillion, one hundred ten billion, one hundred six million, fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •