Base | Representation |
---|---|
bin | 1010100000100011111000… |
… | …1100100101110101001001 |
3 | 1111220121012100121101220021 |
4 | 2220020332030211311021 |
5 | 3003302111402424223 |
6 | 40324022213100441 |
7 | 2301533263243666 |
oct | 250107614456511 |
9 | 44817170541807 |
10 | 11554505514313 |
11 | 3755269157003 |
12 | 1367410627721 |
13 | 65a77b899238 |
14 | 2bd35362ca6d |
15 | 15085c4ae65d |
hex | a823e325d49 |
11554505514313 has 4 divisors (see below), whose sum is σ = 11693716424208. Its totient is φ = 11415294604420.
The previous prime is 11554505514259. The next prime is 11554505514319. The reversal of 11554505514313 is 31341550545511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11554505514313 - 29 = 11554505513801 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 11554505514313.
It is not an unprimeable number, because it can be changed into a prime (11554505514319) 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, 69605454823 + ... + 69605454988.
It is an arithmetic number, because the mean of its divisors is an integer number (2923429106052).
Almost surely, 211554505514313 is an apocalyptic number.
It is an amenable number.
11554505514313 is a deficient number, since it is larger than the sum of its proper divisors (139210909895).
11554505514313 is an equidigital number, since it uses as much as digits as its factorization.
11554505514313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139210909894.
The product of its (nonzero) digits is 450000, while the sum is 43.
The spelling of 11554505514313 in words is "eleven trillion, five hundred fifty-four billion, five hundred five million, five hundred fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •