Base | Representation |
---|---|
bin | 100000001011001010011… |
… | …110001011111100010011 |
3 | 21211101000002120121200102 |
4 | 200023022132023330103 |
5 | 242211122041213021 |
6 | 4411420215443015 |
7 | 315511614524645 |
oct | 40131236137423 |
9 | 7741002517612 |
10 | 2211010101011 |
11 | 782758619918 |
12 | 2b861298646b |
13 | 1306609066ca |
14 | 79028d10895 |
15 | 3c7a7d3900b |
hex | 202ca78bf13 |
2211010101011 has 8 divisors (see below), whose sum is σ = 2307204564000. Its totient is φ = 2114820937152.
The previous prime is 2211010100989. The next prime is 2211010101049. The reversal of 2211010101011 is 1101010101122.
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 2211010101011 - 230 = 2209936359187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2211010100983 and 2211010101001.
It is not an unprimeable number, because it can be changed into a prime (2211010101061) 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, 460136 + ... + 2152613.
It is an arithmetic number, because the mean of its divisors is an integer number (288400570500).
Almost surely, 22211010101011 is an apocalyptic number.
2211010101011 is a deficient number, since it is larger than the sum of its proper divisors (96194462989).
2211010101011 is a wasteful number, since it uses less digits than its factorization.
2211010101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2649565.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2211010101011 its reverse (1101010101122), we get a palindrome (3312020202133).
It can be divided in two parts, 22 and 11010101011, that multiplied together give a palindrome (242222222242).
The spelling of 2211010101011 in words is "two trillion, two hundred eleven billion, ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •