Base | Representation |
---|---|
bin | 100110001010011… |
… | …010010101100010 |
3 | 1122121202202102210 |
4 | 212022122111202 |
5 | 2302401413042 |
6 | 143311022550 |
7 | 21603102333 |
oct | 4612322542 |
9 | 1577682383 |
10 | 640263522 |
11 | 2a9459508 |
12 | 15a50aa56 |
13 | a2855372 |
14 | 6106828a |
15 | 3b322a9c |
hex | 2629a562 |
640263522 has 16 divisors (see below), whose sum is σ = 1321834752. Its totient is φ = 206536560.
The previous prime is 640263521. The next prime is 640263523. The reversal of 640263522 is 225362046.
It is an interprime number because it is at equal distance from previous prime (640263521) and next prime (640263523).
It is a self number, because there is not a number n which added to its sum of digits gives 640263522.
It is not an unprimeable number, because it can be changed into a prime (640263521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1720953 + ... + 1721324.
It is an arithmetic number, because the mean of its divisors is an integer number (82614672).
Almost surely, 2640263522 is an apocalyptic number.
640263522 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
640263522 is an abundant number, since it is smaller than the sum of its proper divisors (681571230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
640263522 is a wasteful number, since it uses less digits than its factorization.
640263522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3442313.
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 640263522 is about 25303.4290561576. The cubic root of 640263522 is about 861.8921391447.
The spelling of 640263522 in words is "six hundred forty million, two hundred sixty-three thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •