Base | Representation |
---|---|
bin | 111100110011001… |
… | …1001110001000111 |
3 | 12021011211100000020 |
4 | 1321212121301013 |
5 | 13134232011101 |
6 | 534234350223 |
7 | 101361436002 |
oct | 17146316107 |
9 | 5234740006 |
10 | 2040110151 |
11 | 957652a52 |
12 | 48b28b373 |
13 | 26687c091 |
14 | 154d3a539 |
15 | be187136 |
hex | 79999c47 |
2040110151 has 4 divisors (see below), whose sum is σ = 2720146872. Its totient is φ = 1360073432.
The previous prime is 2040110147. The next prime is 2040110173. The reversal of 2040110151 is 1510110402.
It is a happy number.
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 2040110151 - 22 = 2040110147 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2040110151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2040110131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 340018356 + ... + 340018361.
It is an arithmetic number, because the mean of its divisors is an integer number (680036718).
Almost surely, 22040110151 is an apocalyptic number.
2040110151 is a deficient number, since it is larger than the sum of its proper divisors (680036721).
2040110151 is an equidigital number, since it uses as much as digits as its factorization.
2040110151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680036720.
The product of its (nonzero) digits is 40, while the sum is 15.
The square root of 2040110151 is about 45167.5785381506. The cubic root of 2040110151 is about 1268.2879675736.
Adding to 2040110151 its reverse (1510110402), we get a palindrome (3550220553).
The spelling of 2040110151 in words is "two billion, forty million, one hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •