Base | Representation |
---|---|
bin | 10100100101010001… |
… | …10100111010001001 |
3 | 1001112002201210001121 |
4 | 22102220310322021 |
5 | 140112312014401 |
6 | 5024254115241 |
7 | 540555250615 |
oct | 122250647211 |
9 | 31462653047 |
10 | 11050110601 |
11 | 4760554712 |
12 | 21847abb21 |
13 | 10714211aa |
14 | 76b7d6345 |
15 | 44a18bca1 |
hex | 292a34e89 |
11050110601 has 4 divisors (see below), whose sum is σ = 11076483600. Its totient is φ = 11023737604.
The previous prime is 11050110571. The next prime is 11050110623. The reversal of 11050110601 is 10601105011.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10601105011 = 7 ⋅1514443573.
It is a cyclic number.
It is not a de Polignac number, because 11050110601 - 29 = 11050110089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11050110641) 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, 13185871 + ... + 13186708.
It is an arithmetic number, because the mean of its divisors is an integer number (2769120900).
Almost surely, 211050110601 is an apocalyptic number.
It is an amenable number.
11050110601 is a deficient number, since it is larger than the sum of its proper divisors (26372999).
11050110601 is an equidigital number, since it uses as much as digits as its factorization.
11050110601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26372998.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 11050110601 its reverse (10601105011), we get a palindrome (21651215612).
The spelling of 11050110601 in words is "eleven billion, fifty million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •