Base | Representation |
---|---|
bin | 1010000001101000111111… |
… | …1101000010001100110101 |
3 | 1110000211001211000110110212 |
4 | 2200122033331002030311 |
5 | 2421101210103120341 |
6 | 35240011253355205 |
7 | 2215256452255610 |
oct | 240321775021465 |
9 | 43024054013425 |
10 | 11023301223221 |
11 | 356aa57188891 |
12 | 12a0481338b05 |
13 | 61c653a1b9c1 |
14 | 2a1760075177 |
15 | 141b1c16a5eb |
hex | a068ff42335 |
11023301223221 has 16 divisors (see below), whose sum is σ = 13147409049600. Its totient is φ = 9036631576368.
The previous prime is 11023301223211. The next prime is 11023301223251. The reversal of 11023301223221 is 12232210332011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023301223221 is a prime.
It is a super-2 number, since 2×110233012232212 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023301223211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2868761 + ... + 5502398.
It is an arithmetic number, because the mean of its divisors is an integer number (821713065600).
Almost surely, 211023301223221 is an apocalyptic number.
It is an amenable number.
11023301223221 is a deficient number, since it is larger than the sum of its proper divisors (2124107826379).
11023301223221 is an equidigital number, since it uses as much as digits as its factorization.
11023301223221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8379368.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11023301223221 its reverse (12232210332011), we get a palindrome (23255511555232).
The spelling of 11023301223221 in words is "eleven trillion, twenty-three billion, three hundred one million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •