Base | Representation |
---|---|
bin | 10110110000111110000101… |
… | …01011101010100000000101 |
3 | 20120020210110211112000101201 |
4 | 23120133002223222200011 |
5 | 23030200123133423221 |
6 | 254245431222022501 |
7 | 13354536655364341 |
oct | 1330370253524005 |
9 | 216223424460351 |
10 | 50061110061061 |
11 | 14a508855a2490 |
12 | 5746218577a31 |
13 | 21c1986144418 |
14 | c50d83698621 |
15 | 5bc30ea84891 |
hex | 2d87c2aea805 |
50061110061061 has 8 divisors (see below), whose sum is σ = 54612196228800. Its totient is φ = 45510036587040.
The previous prime is 50061110061041. The next prime is 50061110061103. The reversal of 50061110061061 is 16016001116005.
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 50061110061061 - 211 = 50061110059013 is a prime.
It is a super-2 number, since 2×500611100610612 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50061110061031) 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, 6303025 + ... + 11825833.
It is an arithmetic number, because the mean of its divisors is an integer number (6826524528600).
Almost surely, 250061110061061 is an apocalyptic number.
It is an amenable number.
50061110061061 is a deficient number, since it is larger than the sum of its proper divisors (4551086167739).
50061110061061 is a wasteful number, since it uses less digits than its factorization.
50061110061061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6346859.
The product of its (nonzero) digits is 1080, while the sum is 28.
Adding to 50061110061061 its reverse (16016001116005), we get a palindrome (66077111177066).
The spelling of 50061110061061 in words is "fifty trillion, sixty-one billion, one hundred ten million, sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •