Base | Representation |
---|---|
bin | 1010001100000011011111… |
… | …1011101110000101110011 |
3 | 1110122220212111022000011201 |
4 | 2203000313323232011303 |
5 | 2432014113024011011 |
6 | 35454120424152031 |
7 | 2234222166231421 |
oct | 243006773560563 |
9 | 43586774260151 |
10 | 11202213110131 |
11 | 362991729454a |
12 | 130b092608617 |
13 | 6334970b4c44 |
14 | 2aa293548111 |
15 | 1465de089cc1 |
hex | a3037eee173 |
11202213110131 has 16 divisors (see below), whose sum is σ = 11392597032480. Its totient is φ = 11012048974080.
The previous prime is 11202213110117. The next prime is 11202213110147. The reversal of 11202213110131 is 13101131220211.
It is a cyclic number.
It is not a de Polignac number, because 11202213110131 - 229 = 11201676239219 is a prime.
It is a super-2 number, since 2×112022131101312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11202213110099 and 11202213110108.
It is not an unprimeable number, because it can be changed into a prime (11202213116131) 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, 1002250215 + ... + 1002261391.
It is an arithmetic number, because the mean of its divisors is an integer number (712037314530).
Almost surely, 211202213110131 is an apocalyptic number.
11202213110131 is a deficient number, since it is larger than the sum of its proper divisors (190383922349).
11202213110131 is a wasteful number, since it uses less digits than its factorization.
11202213110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19494.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 11202213110131 its reverse (13101131220211), we get a palindrome (24303344330342).
The spelling of 11202213110131 in words is "eleven trillion, two hundred two billion, two hundred thirteen million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •