Base | Representation |
---|---|
bin | 100000000100000000110… |
… | …100111100000000100011 |
3 | 21210122012000001202112110 |
4 | 200010000310330000203 |
5 | 242044411004201011 |
6 | 4404110301330403 |
7 | 315120423560511 |
oct | 40040064740043 |
9 | 7718160052473 |
10 | 2203332100131 |
11 | 77a478591148 |
12 | 2b702b566a03 |
13 | 12ca08cc4716 |
14 | 788db3054b1 |
15 | 3c4a8c45ba6 |
hex | 20100d3c023 |
2203332100131 has 8 divisors (see below), whose sum is σ = 2937831595600. Its totient is φ = 1468860335712.
The previous prime is 2203332100093. The next prime is 2203332100141. The reversal of 2203332100131 is 1310012333022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2203332100131 - 210 = 2203332099107 is a prime.
It is a super-2 number, since 2×22033321001312 (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 = 2203332100098 and 2203332100107.
It is not an unprimeable number, because it can be changed into a prime (2203332100141) 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, 6746656 + ... + 7065693.
It is an arithmetic number, because the mean of its divisors is an integer number (367228949450).
Almost surely, 22203332100131 is an apocalyptic number.
2203332100131 is a deficient number, since it is larger than the sum of its proper divisors (734499495469).
2203332100131 is a wasteful number, since it uses less digits than its factorization.
2203332100131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13865525.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2203332100131 its reverse (1310012333022), we get a palindrome (3513344433153).
The spelling of 2203332100131 in words is "two trillion, two hundred three billion, three hundred thirty-two million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •