Base | Representation |
---|---|
bin | 1010011111101111100001… |
… | …1011100011100100100011 |
3 | 1111212020220210220220121201 |
4 | 2213323320123203210203 |
5 | 3003034320213131321 |
6 | 40313335401302031 |
7 | 2300525053404532 |
oct | 247737033434443 |
9 | 44766823826551 |
10 | 11540450130211 |
11 | 374a30626a992 |
12 | 1364749494917 |
13 | 65934b968402 |
14 | 2bc7bca5a319 |
15 | 1502d858b291 |
hex | a7ef86e3923 |
11540450130211 has 8 divisors (see below), whose sum is σ = 11576117706048. Its totient is φ = 11504823720000.
The previous prime is 11540450130191. The next prime is 11540450130217. The reversal of 11540450130211 is 11203105404511.
It is a happy number.
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 11540450130211 - 217 = 11540449999139 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11540450130211.
It is not an unprimeable number, because it can be changed into a prime (11540450130217) 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, 9729810 + ... + 10851271.
It is an arithmetic number, because the mean of its divisors is an integer number (1447014713256).
Almost surely, 211540450130211 is an apocalyptic number.
11540450130211 is a deficient number, since it is larger than the sum of its proper divisors (35667575837).
11540450130211 is a wasteful number, since it uses less digits than its factorization.
11540450130211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20582813.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 11540450130211 its reverse (11203105404511), we get a palindrome (22743555534722).
The spelling of 11540450130211 in words is "eleven trillion, five hundred forty billion, four hundred fifty million, one hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •