Base | Representation |
---|---|
bin | 1011101100111011101… |
… | …1101100010010111001 |
3 | 201012220211200212021201 |
4 | 2323032323230102321 |
5 | 11243212301000131 |
6 | 232205010134201 |
7 | 20344651633651 |
oct | 2731673542271 |
9 | 635824625251 |
10 | 201040250041 |
11 | 78295a86484 |
12 | 32b67b81361 |
13 | 15c5b9ac947 |
14 | 9a32309361 |
15 | 5369956761 |
hex | 2eceeec4b9 |
201040250041 has 4 divisors (see below), whose sum is σ = 202819367412. Its totient is φ = 199261132672.
The previous prime is 201040250039. The next prime is 201040250107. The reversal of 201040250041 is 140052040102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35794748025 + 165245502016 = 189195^2 + 406504^2 .
It is a cyclic number.
It is not a de Polignac number, because 201040250041 - 21 = 201040250039 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201040250141) 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, 889558516 + ... + 889558741.
It is an arithmetic number, because the mean of its divisors is an integer number (50704841853).
Almost surely, 2201040250041 is an apocalyptic number.
It is an amenable number.
201040250041 is a deficient number, since it is larger than the sum of its proper divisors (1779117371).
201040250041 is a wasteful number, since it uses less digits than its factorization.
201040250041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1779117370.
The product of its (nonzero) digits is 320, while the sum is 19.
Adding to 201040250041 its reverse (140052040102), we get a palindrome (341092290143).
The spelling of 201040250041 in words is "two hundred one billion, forty million, two hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •