Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110110010010010101101 |
3 | 1022210121021202101121212120 |
4 | 2103020213032302102231 |
5 | 2311124322331432341 |
6 | 33300533500223153 |
7 | 2062332166113216 |
oct | 223104716622255 |
9 | 38717252347776 |
10 | 10111011202221 |
11 | 3249068259346 |
12 | 11736b923aab9 |
13 | 584605cb5427 |
14 | 26d53873840d |
15 | 128025bd1066 |
hex | 932273b24ad |
10111011202221 has 8 divisors (see below), whose sum is σ = 13845709033824. Its totient is φ = 6558493752720.
The previous prime is 10111011202217. The next prime is 10111011202273. The reversal of 10111011202221 is 12220211011101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10111011202221 - 22 = 10111011202217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10111011202221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111011202021) 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, 45545095395 + ... + 45545095616.
It is an arithmetic number, because the mean of its divisors is an integer number (1730713629228).
Almost surely, 210111011202221 is an apocalyptic number.
It is an amenable number.
10111011202221 is a deficient number, since it is larger than the sum of its proper divisors (3734697831603).
10111011202221 is an equidigital number, since it uses as much as digits as its factorization.
10111011202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91090191051.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10111011202221 its reverse (12220211011101), we get a palindrome (22331222213322).
The spelling of 10111011202221 in words is "ten trillion, one hundred eleven billion, eleven million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •