Base | Representation |
---|---|
bin | 1010001101001101010010… |
… | …0101001111100011110010 |
3 | 1110201210222221112122202120 |
4 | 2203103110211033203302 |
5 | 2432330144401010002 |
6 | 35511154134255110 |
7 | 2235523100400243 |
oct | 243232445174362 |
9 | 43653887478676 |
10 | 11222021110002 |
11 | 36372613a4a7a |
12 | 1312aa01b7496 |
13 | 635302a76921 |
14 | 2ab212130cca |
15 | 146d9d02bcbc |
hex | a34d494f8f2 |
11222021110002 has 8 divisors (see below), whose sum is σ = 22444042220016. Its totient is φ = 3740673703332.
The previous prime is 11222021109973. The next prime is 11222021110007. The reversal of 11222021110002 is 20001112022211.
11222021110002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
11222021110002 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (11222021110007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 935168425828 + ... + 935168425839.
It is an arithmetic number, because the mean of its divisors is an integer number (2805505277502).
Almost surely, 211222021110002 is an apocalyptic number.
11222021110002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222021110002 is a wasteful number, since it uses less digits than its factorization.
11222021110002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1870336851672.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11222021110002 its reverse (20001112022211), we get a palindrome (31223133132213).
The spelling of 11222021110002 in words is "eleven trillion, two hundred twenty-two billion, twenty-one million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •