Base | Representation |
---|---|
bin | 1010001011111100000010… |
… | …0010100000000000010011 |
3 | 1110122201200220002222112211 |
4 | 2202333000202200000103 |
5 | 2432001012230311011 |
6 | 35453145550532551 |
7 | 2234121434165632 |
oct | 242770042400023 |
9 | 43581626088484 |
10 | 11200210010131 |
11 | 3628a8961a8aa |
12 | 130a813807157 |
13 | 6332380c387c |
14 | 2aa1434c3519 |
15 | 1465232b3b21 |
hex | a2fc08a0013 |
11200210010131 has 8 divisors (see below), whose sum is σ = 11581544399744. Its totient is φ = 10820127951360.
The previous prime is 11200210010113. The next prime is 11200210010153. The reversal of 11200210010131 is 13101001200211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11200210010131 - 211 = 11200210008083 is a prime.
It is a super-2 number, since 2×112002100101312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11200210011131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 313064520 + ... + 313100293.
It is an arithmetic number, because the mean of its divisors is an integer number (1447693049968).
Almost surely, 211200210010131 is an apocalyptic number.
11200210010131 is a deficient number, since it is larger than the sum of its proper divisors (381334389613).
11200210010131 is an equidigital number, since it uses as much as digits as its factorization.
11200210010131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626165421.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11200210010131 its reverse (13101001200211), we get a palindrome (24301211210342).
The spelling of 11200210010131 in words is "eleven trillion, two hundred billion, two hundred ten million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •