Base | Representation |
---|---|
bin | 111100110011010… |
… | …0110011101001111 |
3 | 12021011220222022021 |
4 | 1321212212131033 |
5 | 13134240142002 |
6 | 534235431011 |
7 | 101362043353 |
oct | 17146463517 |
9 | 5234828267 |
10 | 2040162127 |
11 | 957689003 |
12 | 48b2b5467 |
13 | 266899933 |
14 | 154d51463 |
15 | be197737 |
hex | 799a674f |
2040162127 has 8 divisors (see below), whose sum is σ = 2071619456. Its totient is φ = 2008734552.
The previous prime is 2040162101. The next prime is 2040162181. The reversal of 2040162127 is 7212610402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2040162127 - 215 = 2040129359 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 (2040162227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159118 + ... + 171460.
It is an arithmetic number, because the mean of its divisors is an integer number (258952432).
Almost surely, 22040162127 is an apocalyptic number.
2040162127 is a deficient number, since it is larger than the sum of its proper divisors (31457329).
2040162127 is a wasteful number, since it uses less digits than its factorization.
2040162127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14877.
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 2040162127 is about 45168.1539029436. The cubic root of 2040162127 is about 1268.2987382299.
Adding to 2040162127 its reverse (7212610402), we get a palindrome (9252772529).
It can be divided in two parts, 20401 and 62127, that added together give a palindrome (82528).
The spelling of 2040162127 in words is "two billion, forty million, one hundred sixty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •