Base | Representation |
---|---|
bin | 1011101101001111000… |
… | …0111010010110111101 |
3 | 201020010111020010211122 |
4 | 2323103300322112331 |
5 | 11243344023411031 |
6 | 232221023400325 |
7 | 20346654633533 |
oct | 2732360722675 |
9 | 636114203748 |
10 | 201121310141 |
11 | 783278110a4 |
12 | 32b8b1530a5 |
13 | 15c727216bb |
14 | 9a3cdaa153 |
15 | 5371b1947b |
hex | 2ed3c3a5bd |
201121310141 has 4 divisors (see below), whose sum is σ = 201156931392. Its totient is φ = 201085688892.
The previous prime is 201121310069. The next prime is 201121310183. The reversal of 201121310141 is 141013121102.
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 201121310141 - 210 = 201121309117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121370141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17802155 + ... + 17813448.
It is an arithmetic number, because the mean of its divisors is an integer number (50289232848).
Almost surely, 2201121310141 is an apocalyptic number.
It is an amenable number.
201121310141 is a deficient number, since it is larger than the sum of its proper divisors (35621251).
201121310141 is an equidigital number, since it uses as much as digits as its factorization.
201121310141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35621250.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 201121310141 its reverse (141013121102), we get a palindrome (342134431243).
The spelling of 201121310141 in words is "two hundred one billion, one hundred twenty-one million, three hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •