Base | Representation |
---|---|
bin | 1010011101011010111000… |
… | …1100110110010001000101 |
3 | 1111201102221002220002010122 |
4 | 2213112232030312101011 |
5 | 3001411111303224411 |
6 | 40243140232231325 |
7 | 2264613231353561 |
oct | 247265614662105 |
9 | 44642832802118 |
10 | 11500550054981 |
11 | 37343a07618a9 |
12 | 1358a72b3b545 |
13 | 655660501340 |
14 | 2ba8b58606a1 |
15 | 14e2507419db |
hex | a75ae336445 |
11500550054981 has 16 divisors (see below), whose sum is σ = 12451308912000. Its totient is φ = 10559267345088.
The previous prime is 11500550054951. The next prime is 11500550054993. The reversal of 11500550054981 is 18945005500511.
11500550054981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11500550054981 is a prime.
It is a super-2 number, since 2×115005500549812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11500550054941) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7665050 + ... + 9041796.
It is an arithmetic number, because the mean of its divisors is an integer number (778206807000).
Almost surely, 211500550054981 is an apocalyptic number.
It is an amenable number.
11500550054981 is a deficient number, since it is larger than the sum of its proper divisors (950758857019).
11500550054981 is a wasteful number, since it uses less digits than its factorization.
11500550054981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1380188.
The product of its (nonzero) digits is 180000, while the sum is 44.
The spelling of 11500550054981 in words is "eleven trillion, five hundred billion, five hundred fifty million, fifty-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •