Base | Representation |
---|---|
bin | 11101010001001100000… |
… | …001110000010110011011 |
3 | 21010021120100211202202110 |
4 | 131101030001300112123 |
5 | 230423140434120011 |
6 | 4135553204403403 |
7 | 265212250546032 |
oct | 35211401602633 |
9 | 7107510752673 |
10 | 2011320223131 |
11 | 705aa5915a9a |
12 | 2859830a6563 |
13 | 11788891a65b |
14 | 6d4c40b9719 |
15 | 374bbc22ba6 |
hex | 1d44c07059b |
2011320223131 has 8 divisors (see below), whose sum is σ = 2682115574800. Its totient is φ = 1340702510112.
The previous prime is 2011320223043. The next prime is 2011320223183. The reversal of 2011320223131 is 1313220231102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011320223131 - 226 = 2011253114267 is a prime.
It is a super-2 number, since 2×20113202231312 (a number of 25 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 = 2011320223098 and 2011320223107.
It is not an unprimeable number, because it can be changed into a prime (2011320228131) 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, 44383240 + ... + 44428533.
It is an arithmetic number, because the mean of its divisors is an integer number (335264446850).
Almost surely, 22011320223131 is an apocalyptic number.
2011320223131 is a deficient number, since it is larger than the sum of its proper divisors (670795351669).
2011320223131 is an equidigital number, since it uses as much as digits as its factorization.
2011320223131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88819325.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2011320223131 its reverse (1313220231102), we get a palindrome (3324540454233).
The spelling of 2011320223131 in words is "two trillion, eleven billion, three hundred twenty million, two hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •