Base | Representation |
---|---|
bin | 1010001011111100101111… |
… | …1101010111110000011101 |
3 | 1110122202012020121221101201 |
4 | 2202333023331113300131 |
5 | 2432001410302303423 |
6 | 35453220553235501 |
7 | 2234126251541335 |
oct | 242771375276035 |
9 | 43582166557351 |
10 | 11200401603613 |
11 | 3629077790922 |
12 | 130a867a02b91 |
13 | 6332689c66b1 |
14 | 2aa160b180c5 |
15 | 14653500c2ad |
hex | a2fcbf57c1d |
11200401603613 has 4 divisors (see below), whose sum is σ = 11211393166560. Its totient is φ = 11189410040668.
The previous prime is 11200401603577. The next prime is 11200401603649. The reversal of 11200401603613 is 31630610400211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (11200401603577) and next prime (11200401603649).
It is a cyclic number.
It is not a de Polignac number, because 11200401603613 - 237 = 11062962650141 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 (11200401603913) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5495779945 + ... + 5495781982.
It is an arithmetic number, because the mean of its divisors is an integer number (2802848291640).
Almost surely, 211200401603613 is an apocalyptic number.
It is an amenable number.
11200401603613 is a deficient number, since it is larger than the sum of its proper divisors (10991562947).
11200401603613 is a wasteful number, since it uses less digits than its factorization.
11200401603613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10991562946.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 11200401603613 in words is "eleven trillion, two hundred billion, four hundred one million, six hundred three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •