Base | Representation |
---|---|
bin | 1010001101001001110111… |
… | …0011111011001110100001 |
3 | 1110201201121220110210200021 |
4 | 2203102131303323032201 |
5 | 2432321304131241001 |
6 | 35510523031153441 |
7 | 2235461242032313 |
oct | 243223563731641 |
9 | 43651556423607 |
10 | 11221102212001 |
11 | 363692a735340 |
12 | 1312884515881 |
13 | 6351b75945b6 |
14 | 2ab1660957b3 |
15 | 146d4751aba1 |
hex | a349dcfb3a1 |
11221102212001 has 8 divisors (see below), whose sum is σ = 12362402438208. Its totient is φ = 10100001990000.
The previous prime is 11221102211999. The next prime is 11221102212011. The reversal of 11221102212001 is 10021220112211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11221102212001 - 21 = 11221102211999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11221102212011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5049999885 + ... + 5050002106.
It is an arithmetic number, because the mean of its divisors is an integer number (1545300304776).
Almost surely, 211221102212001 is an apocalyptic number.
11221102212001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11221102212001 is a deficient number, since it is larger than the sum of its proper divisors (1141300226207).
11221102212001 is a wasteful number, since it uses less digits than its factorization.
11221102212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10100002103.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11221102212001 its reverse (10021220112211), we get a palindrome (21242322324212).
The spelling of 11221102212001 in words is "eleven trillion, two hundred twenty-one billion, one hundred two million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •