Base | Representation |
---|---|
bin | 11000111010101110011… |
… | …00110010000001110000 |
3 | 10000211220100211112020011 |
4 | 30131113030302001300 |
5 | 103011404313212321 |
6 | 1453152023224304 |
7 | 115566323224000 |
oct | 14352714620160 |
9 | 3024810745204 |
10 | 856161460336 |
11 | 300106908126 |
12 | 119b1a8a8094 |
13 | 62974397500 |
14 | 2d61d0d4000 |
15 | 1740da64ae1 |
hex | c757332070 |
856161460336 has 480 divisors, whose sum is σ = 2191956432000. Its totient is φ = 323352207360.
The previous prime is 856161460289. The next prime is 856161460409. The reversal of 856161460336 is 633064161658.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a self number, because there is not a number n which added to its sum of digits gives 856161460336.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2093304100 + ... + 2093304508.
It is an arithmetic number, because the mean of its divisors is an integer number (4566575900).
Almost surely, 2856161460336 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 856161460336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1095978216000).
856161460336 is an abundant number, since it is smaller than the sum of its proper divisors (1335794971664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
856161460336 is a wasteful number, since it uses less digits than its factorization.
856161460336 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 562 (or 529 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 49.
The spelling of 856161460336 in words is "eight hundred fifty-six billion, one hundred sixty-one million, four hundred sixty thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •