Base | Representation |
---|---|
bin | 10110110010100010101010… |
… | …11010011101110110011111 |
3 | 20120102221212021120211101021 |
4 | 23121101111122131312133 |
5 | 23032041222010123403 |
6 | 254330321522225011 |
7 | 13361461115315554 |
oct | 1331212532356637 |
9 | 216387767524337 |
10 | 50115111411103 |
11 | 14a71776990aa2 |
12 | 57547894b5167 |
13 | 21c6ab0b8919b |
14 | c538275b0a2b |
15 | 5bd9208698bd |
hex | 2d945569dd9f |
50115111411103 has 4 divisors (see below), whose sum is σ = 50820958050768. Its totient is φ = 49409264771440.
The previous prime is 50115111411047. The next prime is 50115111411187. The reversal of 50115111411103 is 30111411151105.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50115111411103 is a prime.
It is a super-2 number, since 2×501151114111032 (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 (50115111411403) 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, 352923319726 + ... + 352923319867.
It is an arithmetic number, because the mean of its divisors is an integer number (12705239512692).
Almost surely, 250115111411103 is an apocalyptic number.
50115111411103 is a deficient number, since it is larger than the sum of its proper divisors (705846639665).
50115111411103 is an equidigital number, since it uses as much as digits as its factorization.
50115111411103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705846639664.
The product of its (nonzero) digits is 300, while the sum is 25.
Adding to 50115111411103 its reverse (30111411151105), we get a palindrome (80226522562208).
The spelling of 50115111411103 in words is "fifty trillion, one hundred fifteen billion, one hundred eleven million, four hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •