Base | Representation |
---|---|
bin | 1010000011100001010101… |
… | …1010100101011101001001 |
3 | 1110010220110010110222012012 |
4 | 2200320111122211131021 |
5 | 2422113334402014401 |
6 | 35302512550025305 |
7 | 2220512125626362 |
oct | 240702532453511 |
9 | 43126403428165 |
10 | 11055605110601 |
11 | 3582723958577 |
12 | 12a6797948235 |
13 | 6227014ba46c |
14 | 2a3146480b69 |
15 | 1428ad1828bb |
hex | a0e156a5749 |
11055605110601 has 4 divisors (see below), whose sum is σ = 11067205956372. Its totient is φ = 11044004264832.
The previous prime is 11055605110577. The next prime is 11055605110663. The reversal of 11055605110601 is 10601150655011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5576096613376 + 5479508497225 = 2361376^2 + 2340835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11055605110601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11055605110801) 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, 5800421456 + ... + 5800423361.
It is an arithmetic number, because the mean of its divisors is an integer number (2766801489093).
Almost surely, 211055605110601 is an apocalyptic number.
It is an amenable number.
11055605110601 is a deficient number, since it is larger than the sum of its proper divisors (11600845771).
11055605110601 is an equidigital number, since it uses as much as digits as its factorization.
11055605110601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11600845770.
The product of its (nonzero) digits is 4500, while the sum is 32.
Adding to 11055605110601 its reverse (10601150655011), we get a palindrome (21656755765612).
The spelling of 11055605110601 in words is "eleven trillion, fifty-five billion, six hundred five million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •