Base | Representation |
---|---|
bin | 1010001001010101100110… |
… | …0001011100000100001001 |
3 | 1110111110101012120012021210 |
4 | 2202111121201130010021 |
5 | 2430233012143140031 |
6 | 35420440342123333 |
7 | 2230650324340032 |
oct | 242253141340411 |
9 | 43443335505253 |
10 | 11155532005641 |
11 | 3611041aa1851 |
12 | 1302025120549 |
13 | 62bc67b1201a |
14 | 2a7d05911a89 |
15 | 1452aac7b746 |
hex | a255985c109 |
11155532005641 has 8 divisors (see below), whose sum is σ = 14874176587680. Its totient is φ = 7436954380352.
The previous prime is 11155532005609. The next prime is 11155532005669. The reversal of 11155532005641 is 14650023555111.
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 11155532005641 - 25 = 11155532005609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11155532005641.
It is not an unprimeable number, because it can be changed into a prime (11155532005141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16349136 + ... + 17017793.
It is an arithmetic number, because the mean of its divisors is an integer number (1859272073460).
Almost surely, 211155532005641 is an apocalyptic number.
It is an amenable number.
11155532005641 is a deficient number, since it is larger than the sum of its proper divisors (3718644582039).
11155532005641 is a wasteful number, since it uses less digits than its factorization.
11155532005641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33478375.
The product of its (nonzero) digits is 90000, while the sum is 39.
The spelling of 11155532005641 in words is "eleven trillion, one hundred fifty-five billion, five hundred thirty-two million, five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •