Base | Representation |
---|---|
bin | 100000000001111011110… |
… | …010101010001011101111 |
3 | 21210102102110020002100222 |
4 | 200001323302222023233 |
5 | 242030323113224403 |
6 | 4403101010441555 |
7 | 315011212301144 |
oct | 40017362521357 |
9 | 7712373202328 |
10 | 2201100133103 |
11 | 7795327082a3 |
12 | 2b6707b932bb |
13 | 12c74177c981 |
14 | 78768b063cb |
15 | 3c3c7d12338 |
hex | 2007bcaa2ef |
2201100133103 has 8 divisors (see below), whose sum is σ = 2242686883200. Its totient is φ = 2159656048728.
The previous prime is 2201100133051. The next prime is 2201100133109. The reversal of 2201100133103 is 3013310011022.
2201100133103 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 2201100133103 - 210 = 2201100132079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201100133109) 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, 35635283 + ... + 35696996.
It is an arithmetic number, because the mean of its divisors is an integer number (280335860400).
Almost surely, 22201100133103 is an apocalyptic number.
2201100133103 is a deficient number, since it is larger than the sum of its proper divisors (41586750097).
2201100133103 is an equidigital number, since it uses as much as digits as its factorization.
2201100133103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71332861.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2201100133103 its reverse (3013310011022), we get a palindrome (5214410144125).
The spelling of 2201100133103 in words is "two trillion, two hundred one billion, one hundred million, one hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •