Base | Representation |
---|---|
bin | 1010001101001001100011… |
… | …1110001101100000000010 |
3 | 1110201201102020200221012222 |
4 | 2203102120332031200002 |
5 | 2432321122340202320 |
6 | 35510511011051042 |
7 | 2235456234652346 |
oct | 243223076154002 |
9 | 43651366627188 |
10 | 11221021022210 |
11 | 363689892123a |
12 | 13128612a0a82 |
13 | 6351a38087bc |
14 | 2ab15939d626 |
15 | 146d4032e825 |
hex | a3498f8d802 |
11221021022210 has 32 divisors (see below), whose sum is σ = 21626237504880. Its totient is φ = 4176919386112.
The previous prime is 11221021022119. The next prime is 11221021022279. The reversal of 11221021022210 is 1222012012211.
It can be written as a sum of positive squares in 8 ways, for example, as 3173410899649 + 8047610122561 = 1781407^2 + 2836831^2 .
It is a super-2 number, since 2×112210210222102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 370805129 + ... + 370835388.
Almost surely, 211221021022210 is an apocalyptic number.
11221021022210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11221021022210 is a deficient number, since it is larger than the sum of its proper divisors (10405216482670).
11221021022210 is a wasteful number, since it uses less digits than its factorization.
11221021022210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 741640630.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11221021022210 its reverse (1222012012211), we get a palindrome (12443033034421).
Subtracting from 11221021022210 its reverse (1222012012211), we obtain a palindrome (9999009009999).
The spelling of 11221021022210 in words is "eleven trillion, two hundred twenty-one billion, twenty-one million, twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •