Base | Representation |
---|---|
bin | 100110001001111… |
… | …110111001100101 |
3 | 1122121120001021112 |
4 | 212021332321211 |
5 | 2302334314031 |
6 | 143304354405 |
7 | 21602123600 |
oct | 4611767145 |
9 | 1577501245 |
10 | 640151141 |
11 | 2a9392033 |
12 | 15a475a05 |
13 | a2816176 |
14 | 61039337 |
15 | 3b2ee62b |
hex | 2627ee65 |
640151141 has 24 divisors (see below), whose sum is σ = 766736640. Its totient is φ = 532677600.
The previous prime is 640151107. The next prime is 640151143. The reversal of 640151141 is 141151046.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-640151141 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 (640151143) 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 23 ways as a sum of consecutive naturals, for example, 234776 + ... + 237486.
It is an arithmetic number, because the mean of its divisors is an integer number (31947360).
Almost surely, 2640151141 is an apocalyptic number.
640151141 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
It is an amenable number.
640151141 is a deficient number, since it is larger than the sum of its proper divisors (126585499).
640151141 is a wasteful number, since it uses less digits than its factorization.
640151141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2865 (or 2858 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 640151141 is about 25301.2082913050. The cubic root of 640151141 is about 861.8417088844.
It can be divided in two parts, 64015 and 1141, that added together give a palindrome (65156).
The spelling of 640151141 in words is "six hundred forty million, one hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •