Base | Representation |
---|---|
bin | 100000001011010000100… |
… | …010111010001001010101 |
3 | 21211101021012022201202001 |
4 | 200023100202322021111 |
5 | 242211324133032013 |
6 | 4411434255515301 |
7 | 315514262625526 |
oct | 40132042721125 |
9 | 7741235281661 |
10 | 2211112002133 |
11 | 782800099721 |
12 | 2b8640b28b31 |
13 | 130678a64628 |
14 | 7903867884d |
15 | 3c7b1c66ddd |
hex | 202d08ba255 |
2211112002133 has 8 divisors (see below), whose sum is σ = 2212676459136. Its totient is φ = 2209547760000.
The previous prime is 2211112002061. The next prime is 2211112002173. The reversal of 2211112002133 is 3312002111122.
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 2211112002133 - 217 = 2211111871061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2211112002133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211112002173) 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, 24413733 + ... + 24504133.
It is an arithmetic number, because the mean of its divisors is an integer number (276584557392).
Almost surely, 22211112002133 is an apocalyptic number.
It is an amenable number.
2211112002133 is a deficient number, since it is larger than the sum of its proper divisors (1564457003).
2211112002133 is a wasteful number, since it uses less digits than its factorization.
2211112002133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107435.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2211112002133 its reverse (3312002111122), we get a palindrome (5523114113255).
The spelling of 2211112002133 in words is "two trillion, two hundred eleven billion, one hundred twelve million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •