Base | Representation |
---|---|
bin | 101101100001010101101011… |
… | …010101000001000111000011 |
3 | 222020212020020001021010011210 |
4 | 231201111223111001013003 |
5 | 202220111432434141011 |
6 | 1545444012320141203 |
7 | 60112124505342456 |
oct | 5541255325010703 |
9 | 866766201233153 |
10 | 200203111240131 |
11 | 5887773201328a |
12 | 1a554854a67803 |
13 | 87930c304023c |
14 | 3761c4cdc749d |
15 | 1822b2072c6a6 |
hex | b6156b5411c3 |
200203111240131 has 16 divisors (see below), whose sum is σ = 278548519366656. Its totient is φ = 127663432814016.
The previous prime is 200203111240127. The next prime is 200203111240213. The reversal of 200203111240131 is 131042111302002.
It is not a de Polignac number, because 200203111240131 - 22 = 200203111240127 is a prime.
It is a super-2 number, since 2×2002031112401312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200203111240098 and 200203111240107.
It is not an unprimeable number, because it can be changed into a prime (200203111245131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22525810 + ... + 30130023.
It is an arithmetic number, because the mean of its divisors is an integer number (17409282460416).
Almost surely, 2200203111240131 is an apocalyptic number.
200203111240131 is a deficient number, since it is larger than the sum of its proper divisors (78345408126525).
200203111240131 is a wasteful number, since it uses less digits than its factorization.
200203111240131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52710962.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 200203111240131 its reverse (131042111302002), we get a palindrome (331245222542133).
The spelling of 200203111240131 in words is "two hundred trillion, two hundred three billion, one hundred eleven million, two hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •