Base | Representation |
---|---|
bin | 1010011111101111100001… |
… | …1011100011100100100101 |
3 | 1111212020220210220220121210 |
4 | 2213323320123203210211 |
5 | 3003034320213131323 |
6 | 40313335401302033 |
7 | 2300525053404534 |
oct | 247737033434445 |
9 | 44766823826553 |
10 | 11540450130213 |
11 | 374a30626a994 |
12 | 1364749494919 |
13 | 65934b968404 |
14 | 2bc7bca5a31b |
15 | 1502d858b293 |
hex | a7ef86e3925 |
11540450130213 has 8 divisors (see below), whose sum is σ = 15420500679808. Its totient is φ = 7677016500384.
The previous prime is 11540450130191. The next prime is 11540450130217. The reversal of 11540450130213 is 31203105404511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11540450130213 - 210 = 11540450129189 is a prime.
It is a Duffinian number.
It is a congruent number.
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, 4154228320 + ... + 4154231097.
It is an arithmetic number, because the mean of its divisors is an integer number (1927562584976).
Almost surely, 211540450130213 is an apocalyptic number.
It is an amenable number.
11540450130213 is a deficient number, since it is larger than the sum of its proper divisors (3880050549595).
11540450130213 is an equidigital number, since it uses as much as digits as its factorization.
11540450130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8308459883.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 11540450130213 its reverse (31203105404511), we get a palindrome (42743555534724).
The spelling of 11540450130213 in words is "eleven trillion, five hundred forty billion, four hundred fifty million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •