Base | Representation |
---|---|
bin | 1011110100101100100… |
… | …1101101110101010101 |
3 | 201102022002012121221111 |
4 | 2331023021231311111 |
5 | 11311444310114031 |
6 | 233151454415021 |
7 | 20450416033456 |
oct | 2751311556525 |
9 | 642262177844 |
10 | 203124301141 |
11 | 79165410963 |
12 | 33449b01471 |
13 | 162016a5288 |
14 | 9b8d00312d |
15 | 543c8bd1b1 |
hex | 2f4b26dd55 |
203124301141 has 4 divisors (see below), whose sum is σ = 209676697984. Its totient is φ = 196571904300.
The previous prime is 203124301109. The next prime is 203124301153. The reversal of 203124301141 is 141103421302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 203124301141 - 25 = 203124301109 is a prime.
It is a super-3 number, since 3×2031243011413 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203124301181) 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, 3276198375 + ... + 3276198436.
It is an arithmetic number, because the mean of its divisors is an integer number (52419174496).
Almost surely, 2203124301141 is an apocalyptic number.
It is an amenable number.
203124301141 is a deficient number, since it is larger than the sum of its proper divisors (6552396843).
203124301141 is an equidigital number, since it uses as much as digits as its factorization.
203124301141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6552396842.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 203124301141 its reverse (141103421302), we get a palindrome (344227722443).
The spelling of 203124301141 in words is "two hundred three billion, one hundred twenty-four million, three hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •