Base | Representation |
---|---|
bin | 110000111100000… |
… | …0100101110110101 |
3 | 11020102212210011211 |
4 | 1201320010232311 |
5 | 11330333330042 |
6 | 430535401421 |
7 | 55456346434 |
oct | 14170045665 |
9 | 4212783154 |
10 | 1642089397 |
11 | 772a0a083 |
12 | 399b23271 |
13 | 202281640 |
14 | 11812d11b |
15 | 99265017 |
hex | 61e04bb5 |
1642089397 has 8 divisors (see below), whose sum is σ = 1768840416. Its totient is φ = 1515400752.
The previous prime is 1642089391. The next prime is 1642089403. The reversal of 1642089397 is 7939802461.
It is an interprime number because it is at equal distance from previous prime (1642089391) and next prime (1642089403).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1642089397 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1642089397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1642089391) 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, 49038 + ... + 75424.
It is an arithmetic number, because the mean of its divisors is an integer number (221105052).
Almost surely, 21642089397 is an apocalyptic number.
It is an amenable number.
1642089397 is a deficient number, since it is larger than the sum of its proper divisors (126751019).
1642089397 is a wasteful number, since it uses less digits than its factorization.
1642089397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31187.
The product of its (nonzero) digits is 653184, while the sum is 49.
The square root of 1642089397 is about 40522.7022420766. The cubic root of 1642089397 is about 1179.7743025678.
The spelling of 1642089397 in words is "one billion, six hundred forty-two million, eighty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •