Base | Representation |
---|---|
bin | 10011000101111100000… |
… | …11001110011011010000 |
3 | 2022201022102001001012210 |
4 | 21202332003032123100 |
5 | 41222014011424202 |
6 | 1221212325152120 |
7 | 65252606063034 |
oct | 11427603163320 |
9 | 2281272031183 |
10 | 656023545552 |
11 | 233244209571 |
12 | a7184b5b640 |
13 | 49b2a61b16b |
14 | 23a749921c4 |
15 | 120e844bc6c |
hex | 98be0ce6d0 |
656023545552 has 80 divisors (see below), whose sum is σ = 1741141373312. Its totient is φ = 212689774080.
The previous prime is 656023545539. The next prime is 656023545557. The reversal of 656023545552 is 255545320656.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (656023545557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5117277 + ... + 5243907.
Almost surely, 2656023545552 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 656023545552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (870570686656).
656023545552 is an abundant number, since it is smaller than the sum of its proper divisors (1085117827760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
656023545552 is a wasteful number, since it uses less digits than its factorization.
656023545552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129596 (or 129590 counting only the distinct ones).
The product of its (nonzero) digits is 5400000, while the sum is 48.
The spelling of 656023545552 in words is "six hundred fifty-six billion, twenty-three million, five hundred forty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •