Base | Representation |
---|---|
bin | 10011100101011101010… |
… | …11010011111001010000 |
3 | 2101022222201122202112020 |
4 | 21302232223103321100 |
5 | 42011143021044230 |
6 | 1233051421131440 |
7 | 66422134156422 |
oct | 11625653237120 |
9 | 2338881582466 |
10 | 672945487440 |
11 | 23a438202a06 |
12 | aa5080b9b80 |
13 | 4b5c63b1025 |
14 | 247dc152812 |
15 | 12788d55810 |
hex | 9caead3e50 |
672945487440 has 80 divisors (see below), whose sum is σ = 2086385064000. Its totient is φ = 179430276096.
The previous prime is 672945487439. The next prime is 672945487453. The reversal of 672945487440 is 44784549276.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
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, 1854036 + ... + 2187084.
It is an arithmetic number, because the mean of its divisors is an integer number (26079813300).
Almost surely, 2672945487440 is an apocalyptic number.
672945487440 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
672945487440 is an abundant number, since it is smaller than the sum of its proper divisors (1413439576560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
672945487440 is a wasteful number, since it uses less digits than its factorization.
672945487440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341484 (or 341478 counting only the distinct ones).
The product of its (nonzero) digits is 54190080, while the sum is 60.
The spelling of 672945487440 in words is "six hundred seventy-two billion, nine hundred forty-five million, four hundred eighty-seven thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •