Base | Representation |
---|---|
bin | 100111111101100… |
… | …000000100100000 |
3 | 1201201112112221220 |
4 | 213331200010200 |
5 | 2333112333233 |
6 | 150305415040 |
7 | 22420406550 |
oct | 4775400440 |
9 | 1651475856 |
10 | 670433568 |
11 | 314495732 |
12 | 16863a480 |
13 | a8b8986c |
14 | 6507d160 |
15 | 3dcd1eb3 |
hex | 27f60120 |
670433568 has 96 divisors (see below), whose sum is σ = 2054191104. Its totient is φ = 187468032.
The previous prime is 670433531. The next prime is 670433609. The reversal of 670433568 is 865334076.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20971 + ... + 42197.
It is an arithmetic number, because the mean of its divisors is an integer number (21397824).
Almost surely, 2670433568 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 670433568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1027095552).
670433568 is an abundant number, since it is smaller than the sum of its proper divisors (1383757536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
670433568 is a wasteful number, since it uses less digits than its factorization.
670433568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21294 (or 21286 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 42.
The square root of 670433568 is about 25892.7319531949. The cubic root of 670433568 is about 875.2227212088. Note that the first 3 decimals are identical.
The spelling of 670433568 in words is "six hundred seventy million, four hundred thirty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •