Base | Representation |
---|---|
bin | 10011101010010000010… |
… | …11000101011111000000 |
3 | 2101120122012102200200000 |
4 | 21311020023011133000 |
5 | 42031431301343242 |
6 | 1234155133400000 |
7 | 66543014321355 |
oct | 11651013053700 |
9 | 2346565380600 |
10 | 675520731072 |
11 | 240539929630 |
12 | aab06639000 |
13 | 4b916a96925 |
14 | 249a418c62c |
15 | 12889e95a4c |
hex | 9d482c57c0 |
675520731072 has 1344 divisors, whose sum is σ = 2443589890560. Its totient is φ = 182742220800.
The previous prime is 675520731059. The next prime is 675520731089. The reversal of 675520731072 is 270137025576.
675520731072 is a `hidden beast` number, since 67 + 5 + 5 + 207 + 310 + 72 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 4930808188 + ... + 4930808324.
It is an arithmetic number, because the mean of its divisors is an integer number (1818147240).
Almost surely, 2675520731072 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 675520731072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1221794945280).
675520731072 is an abundant number, since it is smaller than the sum of its proper divisors (1768069159488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675520731072 is a wasteful number, since it uses less digits than its factorization.
675520731072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 250 counting only the distinct ones).
The product of its (nonzero) digits is 617400, while the sum is 45.
The spelling of 675520731072 in words is "six hundred seventy-five billion, five hundred twenty million, seven hundred thirty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •