Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110100101001111001001 |
3 | 1102222122100020022212010102 |
4 | 2200032303112211033021 |
5 | 2420401022104033001 |
6 | 35230215510455145 |
7 | 2214343045416110 |
oct | 240166326451711 |
9 | 42878306285112 |
10 | 11011010221001 |
11 | 356581a238a0a |
12 | 129a0110644b5 |
13 | 61b4454b9a1b |
14 | 2a0d15946c77 |
15 | 14164d0b6e6b |
hex | a03b35a53c9 |
11011010221001 has 32 divisors (see below), whose sum is σ = 12767257939968. Its totient is φ = 9301152389760.
The previous prime is 11011010220967. The next prime is 11011010221039. The reversal of 11011010221001 is 10012201011011.
It is not a de Polignac number, because 11011010221001 - 234 = 10993830351817 is a prime.
It is a super-2 number, since 2×110110102210012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11011010221201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1328063666 + ... + 1328071956.
It is an arithmetic number, because the mean of its divisors is an integer number (398976810624).
Almost surely, 211011010221001 is an apocalyptic number.
It is an amenable number.
11011010221001 is a deficient number, since it is larger than the sum of its proper divisors (1756247718967).
11011010221001 is an equidigital number, since it uses as much as digits as its factorization.
11011010221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13781.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011010221001 its reverse (10012201011011), we get a palindrome (21023211232012).
The spelling of 11011010221001 in words is "eleven trillion, eleven billion, ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •