Base | Representation |
---|---|
bin | 10100110111001101… |
… | …00011011010111111 |
3 | 1001220120201211202001 |
4 | 22123212203122333 |
5 | 140414312302011 |
6 | 5051225443131 |
7 | 544362522013 |
oct | 123346433277 |
9 | 31816654661 |
10 | 11200509631 |
11 | 4828439733 |
12 | 22070404a7 |
13 | 109662c8bc |
14 | 783786543 |
15 | 4584997c1 |
hex | 29b9a36bf |
11200509631 has 2 divisors, whose sum is σ = 11200509632. Its totient is φ = 11200509630.
The previous prime is 11200509613. The next prime is 11200509707. The reversal of 11200509631 is 13690500211.
Together with previous prime (11200509613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11200509631 - 25 = 11200509599 is a prime.
It is a super-2 number, since 2×112005096312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11200509631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200509611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600254815 + 5600254816.
It is an arithmetic number, because the mean of its divisors is an integer number (5600254816).
Almost surely, 211200509631 is an apocalyptic number.
11200509631 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200509631 is an equidigital number, since it uses as much as digits as its factorization.
11200509631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 28.
The spelling of 11200509631 in words is "eleven billion, two hundred million, five hundred nine thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •