Base | Representation |
---|---|
bin | 1010001101000101110101… |
… | …0111100000100101011101 |
3 | 1110201121211120000121110220 |
4 | 2203101131113200211131 |
5 | 2432312100340133041 |
6 | 35510223445351553 |
7 | 2235422403045111 |
oct | 243213527404535 |
9 | 43647746017426 |
10 | 11220021021021 |
11 | 36364253a757a |
12 | 13126224085b9 |
13 | 63507459ac17 |
14 | 2ab0a2651741 |
15 | 146cd264cd66 |
hex | a345d5e095d |
11220021021021 has 8 divisors (see below), whose sum is σ = 15747397924320. Its totient is φ = 7086329065872.
The previous prime is 11220021020963. The next prime is 11220021021037. The reversal of 11220021021021 is 12012012002211.
11220021021021 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.
It is not a de Polignac number, because 11220021021021 - 226 = 11219953912157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220021026021) 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, 98421236970 + ... + 98421237083.
It is an arithmetic number, because the mean of its divisors is an integer number (1968424740540).
Almost surely, 211220021021021 is an apocalyptic number.
It is an amenable number.
11220021021021 is a deficient number, since it is larger than the sum of its proper divisors (4527376903299).
11220021021021 is a wasteful number, since it uses less digits than its factorization.
11220021021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196842474075.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11220021021021 its reverse (12012012002211), we get a palindrome (23232033023232).
The spelling of 11220021021021 in words is "eleven trillion, two hundred twenty billion, twenty-one million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •