Base | Representation |
---|---|
bin | 10110101111100000110000… |
… | …01101111011111010101101 |
3 | 20120002000010221221122110202 |
4 | 23113300120031323322231 |
5 | 23023340014402013401 |
6 | 254210423323243245 |
7 | 13351114223555141 |
oct | 1327603015737255 |
9 | 216060127848422 |
10 | 50011005501101 |
11 | 14a31603903a47 |
12 | 5738574679525 |
13 | 21ba02c8254c8 |
14 | c4c78d10b221 |
15 | 5bad7ae3906b |
hex | 2d7c1837bead |
50011005501101 has 8 divisors (see below), whose sum is σ = 51626223984384. Its totient is φ = 48395909532960.
The previous prime is 50011005501071. The next prime is 50011005501203. The reversal of 50011005501101 is 10110550011005.
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 50011005501101 - 210 = 50011005500077 is a prime.
It is a super-2 number, since 2×500110055011012 (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 (50011005501701) 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, 29798840 + ... + 31432353.
It is an arithmetic number, because the mean of its divisors is an integer number (6453277998048).
Almost surely, 250011005501101 is an apocalyptic number.
It is an amenable number.
50011005501101 is a deficient number, since it is larger than the sum of its proper divisors (1615218483283).
50011005501101 is a wasteful number, since it uses less digits than its factorization.
50011005501101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61257571.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 50011005501101 its reverse (10110550011005), we get a palindrome (60121555512106).
The spelling of 50011005501101 in words is "fifty trillion, eleven billion, five million, five hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.207 sec. • engine limits •