Base | Representation |
---|---|
bin | 10110110010011010010001… |
… | …00101000001001001011011 |
3 | 20120102112012221122120221112 |
4 | 23121031020211001021123 |
5 | 23032003002340343021 |
6 | 254324254202530535 |
7 | 13361241260335205 |
oct | 1331151045011133 |
9 | 216375187576845 |
10 | 50110601106011 |
11 | 14a6a871a42026 |
12 | 575392ab06a4b |
13 | 21c6542614cc4 |
14 | c5351a581775 |
15 | 5bd7598e2d5b |
hex | 2d934894125b |
50110601106011 has 4 divisors (see below), whose sum is σ = 50429776909392. Its totient is φ = 49791425302632.
The previous prime is 50110601105951. The next prime is 50110601106067. The reversal of 50110601106011 is 11060110601105.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50110601106011 - 222 = 50110596911707 is a prime.
It is a super-2 number, since 2×501106011060112 (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 (50110601106611) 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, 159587901455 + ... + 159587901768.
It is an arithmetic number, because the mean of its divisors is an integer number (12607444227348).
Almost surely, 250110601106011 is an apocalyptic number.
50110601106011 is a deficient number, since it is larger than the sum of its proper divisors (319175803381).
50110601106011 is a wasteful number, since it uses less digits than its factorization.
50110601106011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319175803380.
The product of its (nonzero) digits is 180, while the sum is 23.
Adding to 50110601106011 its reverse (11060110601105), we get a palindrome (61170711707116).
The spelling of 50110601106011 in words is "fifty trillion, one hundred ten billion, six hundred one million, one hundred six thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •