Base | Representation |
---|---|
bin | 10011100001111010011… |
… | …00010100111100000000 |
3 | 2101011002001001012102110 |
4 | 21300331030110330000 |
5 | 41443243113233330 |
6 | 1232134445015320 |
7 | 66324014655660 |
oct | 11607514247400 |
9 | 2334061035373 |
10 | 671041539840 |
11 | 2396505009a1 |
12 | aa076554540 |
13 | 4b381ac7709 |
14 | 2469b33c1a0 |
15 | 126c6b17db0 |
hex | 9c3d314f00 |
671041539840 has 144 divisors (see below), whose sum is σ = 2449301718528. Its totient is φ = 153380917248.
The previous prime is 671041539827. The next prime is 671041539851. The reversal of 671041539840 is 48935140176.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 671041539840.
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 15 ways as a sum of consecutive naturals, for example, 12455292 + ... + 12509051.
It is an arithmetic number, because the mean of its divisors is an integer number (17009039712).
Almost surely, 2671041539840 is an apocalyptic number.
671041539840 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
671041539840 is an abundant number, since it is smaller than the sum of its proper divisors (1778260178688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
671041539840 is a wasteful number, since it uses less digits than its factorization.
671041539840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24964374 (or 24964360 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 48.
The spelling of 671041539840 in words is "six hundred seventy-one billion, forty-one million, five hundred thirty-nine thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •