Base | Representation |
---|---|
bin | 100000001011001011000… |
… | …111110110001100111011 |
3 | 21211101000212010110110220 |
4 | 200023023013312030323 |
5 | 242211132340201021 |
6 | 4411421245511123 |
7 | 315512106411414 |
oct | 40131307661473 |
9 | 7741025113426 |
10 | 2211021022011 |
11 | 7827637a8a3a |
12 | 2b86165724a3 |
13 | 130662c5b539 |
14 | 7902a55480b |
15 | 3c7a8c94cc6 |
hex | 202cb1f633b |
2211021022011 has 8 divisors (see below), whose sum is σ = 2957630727744. Its totient is φ = 1469212665480.
The previous prime is 2211021021997. The next prime is 2211021022027. The reversal of 2211021022011 is 1102201201122.
2211021022011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2211021022011 - 230 = 2209947280187 is a prime.
It is a super-2 number, since 2×22110210220112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2211021022051) 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, 1200336225 + ... + 1200338066.
It is an arithmetic number, because the mean of its divisors is an integer number (369703840968).
Almost surely, 22211021022011 is an apocalyptic number.
2211021022011 is a deficient number, since it is larger than the sum of its proper divisors (746609705733).
2211021022011 is a wasteful number, since it uses less digits than its factorization.
2211021022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400674601.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2211021022011 its reverse (1102201201122), we get a palindrome (3313222223133).
The spelling of 2211021022011 in words is "two trillion, two hundred eleven billion, twenty-one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •