Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …0101000101001001100111 |
3 | 1110000201021112202200220202 |
4 | 2200121033211011021213 |
5 | 2421042002111431043 |
6 | 35235312153021115 |
7 | 2215220626243013 |
oct | 240311745051147 |
9 | 43021245680822 |
10 | 11022221202023 |
11 | 356a552579989 |
12 | 12a021b6b479b |
13 | 61c5110448c5 |
14 | 2a169a857543 |
15 | 141aa742e1b8 |
hex | a064f945267 |
11022221202023 has 8 divisors (see below), whose sum is σ = 11044104382080. Its totient is φ = 11000345530720.
The previous prime is 11022221202007. The next prime is 11022221202029. The reversal of 11022221202023 is 32020212222011.
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 11022221202023 - 24 = 11022221202007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11022221201986 and 11022221202004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022221202029) 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, 1066133 + ... + 4814673.
It is an arithmetic number, because the mean of its divisors is an integer number (1380513047760).
Almost surely, 211022221202023 is an apocalyptic number.
11022221202023 is a deficient number, since it is larger than the sum of its proper divisors (21883180057).
11022221202023 is an equidigital number, since it uses as much as digits as its factorization.
11022221202023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3754377.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 11022221202023 its reverse (32020212222011), we get a palindrome (43042433424034).
The spelling of 11022221202023 in words is "eleven trillion, twenty-two billion, two hundred twenty-one million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •