Base | Representation |
---|---|
bin | 100000000001111100100… |
… | …011110010101101101111 |
3 | 21210102110100110110102000 |
4 | 200001330203302231233 |
5 | 242030334412404403 |
6 | 4403102150503343 |
7 | 315011426624154 |
oct | 40017443625557 |
9 | 7712410413360 |
10 | 2201113013103 |
11 | 779539a05224 |
12 | 2b6710364b53 |
13 | 12c74433c384 |
14 | 7876a6da22b |
15 | 3c3c90087a3 |
hex | 2007c8f2b6f |
2201113013103 has 32 divisors (see below), whose sum is σ = 3286248979200. Its totient is φ = 1456008372000.
The previous prime is 2201113013069. The next prime is 2201113013117. The reversal of 2201113013103 is 3013103111022.
2201113013103 is a `hidden beast` number, since 220 + 1 + 1 + 130 + 1 + 310 + 3 = 666.
2201113013103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2201113013103 - 216 = 2201112947567 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201113013123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28614828 + ... + 28691646.
It is an arithmetic number, because the mean of its divisors is an integer number (102695280600).
Almost surely, 22201113013103 is an apocalyptic number.
2201113013103 is a deficient number, since it is larger than the sum of its proper divisors (1085135966097).
2201113013103 is a wasteful number, since it uses less digits than its factorization.
2201113013103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85060 (or 85054 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2201113013103 its reverse (3013103111022), we get a palindrome (5214216124125).
The spelling of 2201113013103 in words is "two trillion, two hundred one billion, one hundred thirteen million, thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •