Base | Representation |
---|---|
bin | 10011100010010001111… |
… | …11001011111001110000 |
3 | 2101011120211101122002202 |
4 | 21301020333023321300 |
5 | 41444144242442202 |
6 | 1232210234202332 |
7 | 66331636641410 |
oct | 11611077137160 |
9 | 2334524348082 |
10 | 671239421552 |
11 | 2397421773a7 |
12 | aa1108833a8 |
13 | 4b3b3abc79b |
14 | 246b972c640 |
15 | 126d91a4802 |
hex | 9c48fcbe70 |
671239421552 has 320 divisors, whose sum is σ = 1680486727680. Its totient is φ = 252829237248.
The previous prime is 671239421549. The next prime is 671239421599. The reversal of 671239421552 is 255124932176.
It is a super-2 number, since 2×6712394215522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 671239421497 and 671239421506.
It is a congruent number.
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, 886709558 + ... + 886710314.
It is an arithmetic number, because the mean of its divisors is an integer number (5251521024).
Almost surely, 2671239421552 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 671239421552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (840243363840).
671239421552 is an abundant number, since it is smaller than the sum of its proper divisors (1009247306128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
671239421552 is a wasteful number, since it uses less digits than its factorization.
671239421552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128 (or 1122 counting only the distinct ones).
The product of its digits is 907200, while the sum is 47.
The spelling of 671239421552 in words is "six hundred seventy-one billion, two hundred thirty-nine million, four hundred twenty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •