Base | Representation |
---|---|
bin | 101000001111011… |
… | …101010110001000 |
3 | 1202001101201100020 |
4 | 220033131112020 |
5 | 2340314003000 |
6 | 150554340440 |
7 | 22505414052 |
oct | 5017352610 |
9 | 1661351306 |
10 | 675141000 |
11 | 317110476 |
12 | 16a12a720 |
13 | a9b47421 |
14 | 659468d2 |
15 | 3e411ba0 |
hex | 283dd588 |
675141000 has 128 divisors (see below), whose sum is σ = 2116108800. Its totient is φ = 179212800.
The previous prime is 675140989. The next prime is 675141029. The reversal of 675141000 is 141576.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 938641 + ... + 939359.
It is an arithmetic number, because the mean of its divisors is an integer number (16532100).
Almost surely, 2675141000 is an apocalyptic number.
675141000 is a gapful number since it is divisible by the number (60) 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 675141000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1058054400).
675141000 is an abundant number, since it is smaller than the sum of its proper divisors (1440967800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675141000 is a wasteful number, since it uses less digits than its factorization.
675141000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1056 (or 1042 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 675141000 is about 25983.4755181057. The cubic root of 675141000 is about 877.2663966931.
Adding to 675141000 its reverse (141576), we get a palindrome (675282576).
The spelling of 675141000 in words is "six hundred seventy-five million, one hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •