Base | Representation |
---|---|
bin | 100000000001111011110… |
… | …110110100010011011101 |
3 | 21210102102112021110121110 |
4 | 200001323312310103131 |
5 | 242030323403120013 |
6 | 4403101050052233 |
7 | 315011224461111 |
oct | 40017366642335 |
9 | 7712375243543 |
10 | 2201101223133 |
11 | 77953329224a |
12 | 2b670841a079 |
13 | 12c741a71b67 |
14 | 78768d0b741 |
15 | 3c3c7e7a2c3 |
hex | 2007bdb44dd |
2201101223133 has 8 divisors (see below), whose sum is σ = 3036001687200. Its totient is φ = 1416800787248.
The previous prime is 2201101223131. The next prime is 2201101223137. The reversal of 2201101223133 is 3313221011022.
2201101223133 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 a cyclic number.
It is not a de Polignac number, because 2201101223133 - 21 = 2201101223131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201101223131) 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, 12650006943 + ... + 12650007116.
It is an arithmetic number, because the mean of its divisors is an integer number (379500210900).
Almost surely, 22201101223133 is an apocalyptic number.
It is an amenable number.
2201101223133 is a deficient number, since it is larger than the sum of its proper divisors (834900464067).
2201101223133 is a wasteful number, since it uses less digits than its factorization.
2201101223133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25300014091.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2201101223133 its reverse (3313221011022), we get a palindrome (5514322234155).
The spelling of 2201101223133 in words is "two trillion, two hundred one billion, one hundred one million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •