Base | Representation |
---|---|
bin | 101110001011101011111100… |
… | …100001001111101001101011 |
3 | 222122011102202220221102101111 |
4 | 232023223330201033221223 |
5 | 203110301403420014011 |
6 | 1555552533451131151 |
7 | 60532306301563525 |
oct | 5613537441175153 |
9 | 878142686842344 |
10 | 203113240001131 |
11 | 59799928913a19 |
12 | 1a944859143ab7 |
13 | 894465b6216c5 |
14 | 3822a3a13ca15 |
15 | 187369507b121 |
hex | b8bafc84fa6b |
203113240001131 has 4 divisors (see below), whose sum is σ = 203113294309512. Its totient is φ = 203113185692752.
The previous prime is 203113240001107. The next prime is 203113240001137. The reversal of 203113240001131 is 131100042311302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 203113240001131 - 27 = 203113240001003 is a prime.
It is a super-2 number, since 2×2031132400011312 (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 (203113240001137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21093250 + ... + 29174503.
It is an arithmetic number, because the mean of its divisors is an integer number (50778323577378).
Almost surely, 2203113240001131 is an apocalyptic number.
203113240001131 is a deficient number, since it is larger than the sum of its proper divisors (54308381).
203113240001131 is an equidigital number, since it uses as much as digits as its factorization.
203113240001131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54308380.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 203113240001131 its reverse (131100042311302), we get a palindrome (334213282312433).
The spelling of 203113240001131 in words is "two hundred three trillion, one hundred thirteen billion, two hundred forty million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •