Base | Representation |
---|---|
bin | 100000000011101110010… |
… | …011110011001000011011 |
3 | 21210121101100110201210220 |
4 | 200003232103303020123 |
5 | 242043241441020011 |
6 | 4404015402411123 |
7 | 315106632061614 |
oct | 40035623631033 |
9 | 7717340421726 |
10 | 2203021423131 |
11 | 77a3291849a1 |
12 | 2b6b63500aa3 |
13 | 12c989828b89 |
14 | 788abd52c0b |
15 | 3c48b828506 |
hex | 200ee4f321b |
2203021423131 has 8 divisors (see below), whose sum is σ = 2937380741184. Its totient is φ = 1468671526920.
The previous prime is 2203021423103. The next prime is 2203021423157. The reversal of 2203021423131 is 1313241203022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2203021423131 - 213 = 2203021414939 is a prime.
It is a super-2 number, since 2×22030214231312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2203021423531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1790521 + ... + 2758986.
It is an arithmetic number, because the mean of its divisors is an integer number (367172592648).
Almost surely, 22203021423131 is an apocalyptic number.
2203021423131 is a deficient number, since it is larger than the sum of its proper divisors (734359318053).
2203021423131 is a wasteful number, since it uses less digits than its factorization.
2203021423131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4710921.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2203021423131 its reverse (1313241203022), we get a palindrome (3516262626153).
The spelling of 2203021423131 in words is "two trillion, two hundred three billion, twenty-one million, four hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •