Base | Representation |
---|---|
bin | 110000111101001… |
… | …1111011101000100 |
3 | 11020111001222111210 |
4 | 1201322133131010 |
5 | 11331014120030 |
6 | 431001131420 |
7 | 55464626202 |
oct | 14172373504 |
9 | 4214058453 |
10 | 1642723140 |
11 | 773302233 |
12 | 39a189b70 |
13 | 202443c36 |
14 | 118256072 |
15 | 9933cbb0 |
hex | 61e9f744 |
1642723140 has 24 divisors (see below), whose sum is σ = 4599624960. Its totient is φ = 438059488.
The previous prime is 1642723133. The next prime is 1642723157. The reversal of 1642723140 is 413272461.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1642723098 and 1642723107.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 13689300 + ... + 13689419.
It is an arithmetic number, because the mean of its divisors is an integer number (191651040).
Almost surely, 21642723140 is an apocalyptic number.
1642723140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1642723140 is an abundant number, since it is smaller than the sum of its proper divisors (2956901820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1642723140 is a wasteful number, since it uses less digits than its factorization.
1642723140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27378731 (or 27378729 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 1642723140 is about 40530.5210921350. The cubic root of 1642723140 is about 1179.9260558854.
The spelling of 1642723140 in words is "one billion, six hundred forty-two million, seven hundred twenty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •