Base | Representation |
---|---|
bin | 1010000000110111110110… |
… | …1101010110101110010001 |
3 | 1102222120000111211010111111 |
4 | 2200031331231112232101 |
5 | 2420342201204034301 |
6 | 35225550320413321 |
7 | 2214311536511020 |
oct | 240157555265621 |
9 | 42876014733444 |
10 | 11010110221201 |
11 | 35653a8206823 |
12 | 12999bb777241 |
13 | 61b330bc3470 |
14 | 2a0c6c1ca8b7 |
15 | 1415e908a551 |
hex | a037db56b91 |
11010110221201 has 64 divisors (see below), whose sum is σ = 13746450332160. Its totient is φ = 8586254223360.
The previous prime is 11010110221199. The next prime is 11010110221219. The reversal of 11010110221201 is 10212201101011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11010110221201 - 21 = 11010110221199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (11010110221601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6324014191 + ... + 6324015931.
It is an arithmetic number, because the mean of its divisors is an integer number (214788286440).
Almost surely, 211010110221201 is an apocalyptic number.
It is an amenable number.
11010110221201 is a deficient number, since it is larger than the sum of its proper divisors (2736340110959).
11010110221201 is a wasteful number, since it uses less digits than its factorization.
11010110221201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3866.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11010110221201 its reverse (10212201101011), we get a palindrome (21222311322212).
The spelling of 11010110221201 in words is "eleven trillion, ten billion, one hundred ten million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •