Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1110011000100001100101 |
3 | 1110000121200212002102210122 |
4 | 2200120103332120201211 |
5 | 2421032430111431041 |
6 | 35235025031331325 |
7 | 2215154064342062 |
oct | 240302376304145 |
9 | 43017625072718 |
10 | 11021221202021 |
11 | 356a08a0560a8 |
12 | 129bba0820b45 |
13 | 61c3b1b07724 |
14 | 2a1603b09c69 |
15 | 141a4974cc4b |
hex | a0613f98865 |
11021221202021 has 8 divisors (see below), whose sum is σ = 11051516361600. Its totient is φ = 10990947913120.
The previous prime is 11021221201999. The next prime is 11021221202059. The reversal of 11021221202021 is 12020212212011.
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 11021221202021 - 242 = 6623174690917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021221202521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4458176 + ... + 6474393.
It is an arithmetic number, because the mean of its divisors is an integer number (1381439545200).
Almost surely, 211021221202021 is an apocalyptic number.
It is an amenable number.
11021221202021 is a deficient number, since it is larger than the sum of its proper divisors (30295159579).
11021221202021 is a wasteful number, since it uses less digits than its factorization.
11021221202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10935339.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11021221202021 its reverse (12020212212011), we get a palindrome (23041433414032).
The spelling of 11021221202021 in words is "eleven trillion, twenty-one billion, two hundred twenty-one million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •