Base | Representation |
---|---|
bin | 101000010000010… |
… | …101110001101010 |
3 | 1202001211110101220 |
4 | 220100111301222 |
5 | 2340343402023 |
6 | 151003322510 |
7 | 22510365660 |
oct | 5020256152 |
9 | 1661743356 |
10 | 675372138 |
11 | 3172590a1 |
12 | 16a220436 |
13 | a9bc86ac |
14 | 659a6c30 |
15 | 3e45a3e3 |
hex | 28415c6a |
675372138 has 128 divisors (see below), whose sum is σ = 1751777280. Its totient is φ = 169076160.
The previous prime is 675372121. The next prime is 675372167. The reversal of 675372138 is 831273576.
It is a super-2 number, since 2×6753721382 = 912255049573382088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 675372138.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 568381 + ... + 569567.
It is an arithmetic number, because the mean of its divisors is an integer number (13685760).
Almost surely, 2675372138 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 675372138, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (875888640).
675372138 is an abundant number, since it is smaller than the sum of its proper divisors (1076405142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675372138 is a wasteful number, since it uses less digits than its factorization.
675372138 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1272.
The product of its digits is 211680, while the sum is 42.
The square root of 675372138 is about 25987.9229258515. The cubic root of 675372138 is about 877.3664974942.
The spelling of 675372138 in words is "six hundred seventy-five million, three hundred seventy-two thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •