Base | Representation |
---|---|
bin | 100000000010001111101… |
… | …101011101000110011001 |
3 | 21210110021202001012011101 |
4 | 200002033231131012121 |
5 | 242032014141004423 |
6 | 4403154105231401 |
7 | 315022410625660 |
oct | 40021755350631 |
9 | 7713252035141 |
10 | 2201434313113 |
11 | 779694307722 |
12 | 2b679ba92561 |
13 | 12c795a87219 |
14 | 7879b255dd7 |
15 | 3c3e73237ad |
hex | 2008fb5d199 |
2201434313113 has 16 divisors (see below), whose sum is σ = 2564093076480. Its totient is φ = 1851160016016.
The previous prime is 2201434313107. The next prime is 2201434313179. The reversal of 2201434313113 is 3113134341022.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2201434313113 is a prime.
It is a super-2 number, since 2×22014343131132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201434313213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14190643 + ... + 14344936.
It is an arithmetic number, because the mean of its divisors is an integer number (160255817280).
Almost surely, 22201434313113 is an apocalyptic number.
It is an amenable number.
2201434313113 is a deficient number, since it is larger than the sum of its proper divisors (362658763367).
2201434313113 is a wasteful number, since it uses less digits than its factorization.
2201434313113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28535796.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 2201434313113 its reverse (3113134341022), we get a palindrome (5314568654135).
The spelling of 2201434313113 in words is "two trillion, two hundred one billion, four hundred thirty-four million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •