Base | Representation |
---|---|
bin | 111011111010000… |
… | …0100111001010001 |
3 | 12012002102201000120 |
4 | 1313310010321101 |
5 | 13104043441431 |
6 | 531244140453 |
7 | 100545624114 |
oct | 16764047121 |
9 | 5162381016 |
10 | 2010140241 |
11 | 94174312a |
12 | 481237729 |
13 | 2605b79c5 |
14 | 150d7857b |
15 | bb717196 |
hex | 77d04e51 |
2010140241 has 8 divisors (see below), whose sum is σ = 2692890144. Its totient is φ = 1333741920.
The previous prime is 2010140239. The next prime is 2010140243. The reversal of 2010140241 is 1420410102.
It is an interprime number because it is at equal distance from previous prime (2010140239) and next prime (2010140243).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2010140241 - 21 = 2010140239 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2010140241.
It is not an unprimeable number, because it can be changed into a prime (2010140243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1587156 + ... + 1588421.
It is an arithmetic number, because the mean of its divisors is an integer number (336611268).
Almost surely, 22010140241 is an apocalyptic number.
It is an amenable number.
2010140241 is a deficient number, since it is larger than the sum of its proper divisors (682749903).
2010140241 is a wasteful number, since it uses less digits than its factorization.
2010140241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3175791.
The product of its (nonzero) digits is 64, while the sum is 15.
The square root of 2010140241 is about 44834.5875524689. The cubic root of 2010140241 is about 1262.0467785467.
Adding to 2010140241 its reverse (1420410102), we get a palindrome (3430550343).
The spelling of 2010140241 in words is "two billion, ten million, one hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •