Base | Representation |
---|---|
bin | 101000010010000… |
… | …001010000000000 |
3 | 1202002122211021010 |
4 | 220102001100000 |
5 | 2341001443402 |
6 | 151021000520 |
7 | 22514211255 |
oct | 5022012000 |
9 | 1662584233 |
10 | 675812352 |
11 | 317529906 |
12 | 16a3b3140 |
13 | aa020b87 |
14 | 65a7d42c |
15 | 3e4e5a6c |
hex | 28481400 |
675812352 has 88 divisors (see below), whose sum is σ = 1812823200. Its totient is φ = 223830016.
The previous prime is 675812341. The next prime is 675812353. The reversal of 675812352 is 253218576.
It is a self number, because there is not a number n which added to its sum of digits gives 675812352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (675812353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 549274 + ... + 550502.
Almost surely, 2675812352 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 675812352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (906411600).
675812352 is an abundant number, since it is smaller than the sum of its proper divisors (1137010848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675812352 is a wasteful number, since it uses less digits than its factorization.
675812352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1431 (or 1413 counting only the distinct ones).
The product of its digits is 100800, while the sum is 39.
The square root of 675812352 is about 25996.3911341555. The cubic root of 675812352 is about 877.5570813754.
It can be divided in two parts, 6758 and 12352, that added together give a triangular number (19110 = T195).
The spelling of 675812352 in words is "six hundred seventy-five million, eight hundred twelve thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •