Base | Representation |
---|---|
bin | 1010000110001100101000… |
… | …0011101011100100000001 |
3 | 1110022022010120121111110001 |
4 | 2201203022003223210001 |
5 | 2423342021334032421 |
6 | 35335555320240001 |
7 | 2224030431253552 |
oct | 241431203534401 |
9 | 43268116544401 |
10 | 11101585455361 |
11 | 35a01796320a5 |
12 | 12b368a610001 |
13 | 626b4b54625b |
14 | 2a5468dc2329 |
15 | 143b9ebbd691 |
hex | a18ca0eb901 |
11101585455361 has 4 divisors (see below), whose sum is σ = 11102463271872. Its totient is φ = 11100707638852.
The previous prime is 11101585455353. The next prime is 11101585455391. The reversal of 11101585455361 is 16355458510111.
It is a happy number.
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 11101585455361 - 23 = 11101585455353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11101585455391) 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 3 ways as a sum of consecutive naturals, for example, 438889285 + ... + 438914578.
It is an arithmetic number, because the mean of its divisors is an integer number (2775615817968).
Almost surely, 211101585455361 is an apocalyptic number.
It is an amenable number.
11101585455361 is a deficient number, since it is larger than the sum of its proper divisors (877816511).
11101585455361 is an equidigital number, since it uses as much as digits as its factorization.
11101585455361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877816510.
The product of its (nonzero) digits is 360000, while the sum is 46.
The spelling of 11101585455361 in words is "eleven trillion, one hundred one billion, five hundred eighty-five million, four hundred fifty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •