Base | Representation |
---|---|
bin | 100000000001111101101… |
… | …000011010100100010101 |
3 | 21210102111121022101201101 |
4 | 200001331220122210111 |
5 | 242030404014032013 |
6 | 4403104032230101 |
7 | 315012035546260 |
oct | 40017550324425 |
9 | 7712447271641 |
10 | 2201131002133 |
11 | 779549081698 |
12 | 2b671639b331 |
13 | 12c747c9a37b |
14 | 7876cc5dcd7 |
15 | 3c3ca8ad8dd |
hex | 2007da1a915 |
2201131002133 has 16 divisors (see below), whose sum is σ = 2528343360000. Its totient is φ = 1877123912832.
The previous prime is 2201131002067. The next prime is 2201131002143. The reversal of 2201131002133 is 3312001311022.
It is not a de Polignac number, because 2201131002133 - 221 = 2201128904981 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 2201131002133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201131002143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1306143 + ... + 2471491.
It is an arithmetic number, because the mean of its divisors is an integer number (158021460000).
Almost surely, 22201131002133 is an apocalyptic number.
It is an amenable number.
2201131002133 is a deficient number, since it is larger than the sum of its proper divisors (327212357867).
2201131002133 is a wasteful number, since it uses less digits than its factorization.
2201131002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1166724.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2201131002133 its reverse (3312001311022), we get a palindrome (5513132313155).
The spelling of 2201131002133 in words is "two trillion, two hundred one billion, one hundred thirty-one million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •