Base | Representation |
---|---|
bin | 1010000001100001001101… |
… | …1100000101001101100101 |
3 | 1110000121200020011121002121 |
4 | 2200120103130011031211 |
5 | 2421032420311210041 |
6 | 35235024110505541 |
7 | 2215153625041246 |
oct | 240302334051545 |
9 | 43017606147077 |
10 | 11021212210021 |
11 | 356a084a742a2 |
12 | 129bb998052b1 |
13 | 61c3acca9910 |
14 | 2a1602848ccd |
15 | 141a48a737d1 |
hex | a0613705365 |
11021212210021 has 8 divisors (see below), whose sum is σ = 11869280820320. Its totient is φ = 10173184036272.
The previous prime is 11021212209989. The next prime is 11021212210037. The reversal of 11021212210021 is 12001221212011.
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 11021212210021 - 25 = 11021212209989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021212209977 and 11021212210004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021212210091) 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, 9541875 + ... + 10634368.
It is an arithmetic number, because the mean of its divisors is an integer number (1483660102540).
Almost surely, 211021212210021 is an apocalyptic number.
It is an amenable number.
11021212210021 is a deficient number, since it is larger than the sum of its proper divisors (848068610299).
11021212210021 is a wasteful number, since it uses less digits than its factorization.
11021212210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20218275.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11021212210021 its reverse (12001221212011), we get a palindrome (23022433422032).
The spelling of 11021212210021 in words is "eleven trillion, twenty-one billion, two hundred twelve million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •