Base | Representation |
---|---|
bin | 100110110000100… |
… | …010000110000000 |
3 | 1200022120110121000 |
4 | 212300202012000 |
5 | 2312431204033 |
6 | 144305132000 |
7 | 22054043220 |
oct | 4660420600 |
9 | 1608513530 |
10 | 650256768 |
11 | 304064597 |
12 | 16192a000 |
13 | a4943b25 |
14 | 6250a080 |
15 | 3c148a13 |
hex | 26c22180 |
650256768 has 128 divisors (see below), whose sum is σ = 2193408000. Its totient is φ = 185780736.
The previous prime is 650256757. The next prime is 650256769. The reversal of 650256768 is 867652056.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (650256769) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10753 + ... + 37631.
It is an arithmetic number, because the mean of its divisors is an integer number (17136000).
Almost surely, 2650256768 is an apocalyptic number.
650256768 is the 16128-th heptagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 650256768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1096704000).
650256768 is an abundant number, since it is smaller than the sum of its proper divisors (1543151232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
650256768 is a wasteful number, since it uses less digits than its factorization.
650256768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26909 (or 26891 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The square root of 650256768 is about 25500.1327055370. The cubic root of 650256768 is about 866.3531531365.
The spelling of 650256768 in words is "six hundred fifty million, two hundred fifty-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •