Base | Representation |
---|---|
bin | 100110011001000… |
… | …010010000110100 |
3 | 1122212222112002021 |
4 | 212121002100310 |
5 | 2304342101301 |
6 | 143525122524 |
7 | 21650510020 |
oct | 4631022064 |
9 | 1585875067 |
10 | 644097076 |
11 | 300637737 |
12 | 15b859444 |
13 | a359823c |
14 | 61785380 |
15 | 3b82d8a1 |
hex | 26642434 |
644097076 has 48 divisors (see below), whose sum is σ = 1339914240. Its totient is φ = 265063680.
The previous prime is 644097061. The next prime is 644097089. The reversal of 644097076 is 670790446.
It is a super-2 number, since 2×6440970762 = 829722086623499552, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153016 + ... + 157168.
It is an arithmetic number, because the mean of its divisors is an integer number (27914880).
Almost surely, 2644097076 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 644097076, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (669957120).
644097076 is an abundant number, since it is smaller than the sum of its proper divisors (695817164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
644097076 is a wasteful number, since it uses less digits than its factorization.
644097076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4384 (or 4382 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 43.
The square root of 644097076 is about 25379.0676739710. The cubic root of 644097076 is about 863.6088997079.
The spelling of 644097076 in words is "six hundred forty-four million, ninety-seven thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •