Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1110010001101010100101 |
3 | 1110000121102020211121011122 |
4 | 2200120031132101222211 |
5 | 2421032214200401041 |
6 | 35235010133343325 |
7 | 2215151301231431 |
oct | 240301536215245 |
9 | 43017366747148 |
10 | 11021112122021 |
11 | 356a033522741 |
12 | 129bb70197b45 |
13 | 61c395335051 |
14 | 2a15d34339c1 |
15 | 141a3eda2c4b |
hex | a060d791aa5 |
11021112122021 has 8 divisors (see below), whose sum is σ = 11040022872480. Its totient is φ = 11002204940688.
The previous prime is 11021112121973. The next prime is 11021112122029. The reversal of 11021112122021 is 12022121112011.
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 11021112122021 - 214 = 11021112105637 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 (11021112122029) 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, 5325950 + ... + 7099856.
It is an arithmetic number, because the mean of its divisors is an integer number (1380002859060).
Almost surely, 211021112122021 is an apocalyptic number.
It is an amenable number.
11021112122021 is a deficient number, since it is larger than the sum of its proper divisors (18910750459).
11021112122021 is a wasteful number, since it uses less digits than its factorization.
11021112122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1784563.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11021112122021 its reverse (12022121112011), we get a palindrome (23043233234032).
The spelling of 11021112122021 in words is "eleven trillion, twenty-one billion, one hundred twelve million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •