Base | Representation |
---|---|
bin | 101110001010010101001110… |
… | …011000010001110111110011 |
3 | 222121211112102111221122101111 |
4 | 232022111032120101313303 |
5 | 203102240203232232011 |
6 | 1555442054002214151 |
7 | 60522501635523400 |
oct | 5612251630216763 |
9 | 877745374848344 |
10 | 203020124102131 |
11 | 59763395371896 |
12 | 1a92a7b0954357 |
13 | 893893c0c880b |
14 | 381c3254a92a7 |
15 | 18710453b5121 |
hex | b8a54e611df3 |
203020124102131 has 6 divisors (see below), whose sum is σ = 236166266812740. Its totient is φ = 174017249230356.
The previous prime is 203020124102123. The next prime is 203020124102171. The reversal of 203020124102131 is 131201421020302.
It is not a de Polignac number, because 203020124102131 - 23 = 203020124102123 is a prime.
It is a super-2 number, since 2×2030201241021312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203020124102171) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2071633919361 + ... + 2071633919458.
It is an arithmetic number, because the mean of its divisors is an integer number (39361044468790).
Almost surely, 2203020124102131 is an apocalyptic number.
203020124102131 is a deficient number, since it is larger than the sum of its proper divisors (33146142710609).
203020124102131 is an equidigital number, since it uses as much as digits as its factorization.
203020124102131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4143267838833 (or 4143267838826 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 203020124102131 its reverse (131201421020302), we get a palindrome (334221545122433).
The spelling of 203020124102131 in words is "two hundred three trillion, twenty billion, one hundred twenty-four million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •