Base | Representation |
---|---|
bin | 100110001101010… |
… | …110001000000000 |
3 | 1122200012211120000 |
4 | 212031112020000 |
5 | 2303101021304 |
6 | 143335320000 |
7 | 21612455004 |
oct | 4615261000 |
9 | 1580184500 |
10 | 641032704 |
11 | 2a99343a4 |
12 | 15a820000 |
13 | a2a644c0 |
14 | 611c8704 |
15 | 3b425939 |
hex | 26356200 |
641032704 has 400 divisors, whose sum is σ = 2183532120. Its totient is φ = 185794560.
The previous prime is 641032657. The next prime is 641032729. The reversal of 641032704 is 407230146.
It can be written as a sum of positive squares in 4 ways, for example, as 274233600 + 366799104 = 16560^2 + 19152^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 15634924 + ... + 15634964.
Almost surely, 2641032704 is an apocalyptic number.
641032704 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 641032704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1091766060).
641032704 is an abundant number, since it is smaller than the sum of its proper divisors (1542499416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641032704 is a wasteful number, since it uses less digits than its factorization.
641032704 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113 (or 88 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 641032704 is about 25318.6236592750. The cubic root of 641032704 is about 862.2371463665.
The spelling of 641032704 in words is "six hundred forty-one million, thirty-two thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •