Base | Representation |
---|---|
bin | 100111010000101110… |
… | …111001011110110000 |
3 | 11000210222012020202002 |
4 | 213100232321132300 |
5 | 1142314101120111 |
6 | 31211055313132 |
7 | 3021452463125 |
oct | 472056713660 |
9 | 130728166662 |
10 | 42156660656 |
11 | 16973377120 |
12 | 820621b7a8 |
13 | 3c8ab1b426 |
14 | 207cba674c |
15 | 116aee263b |
hex | 9d0bb97b0 |
42156660656 has 80 divisors (see below), whose sum is σ = 94417135488. Its totient is φ = 18021196800.
The previous prime is 42156660641. The next prime is 42156660671. The reversal of 42156660656 is 65606665124.
It is an interprime number because it is at equal distance from previous prime (42156660641) and next prime (42156660671).
It is a self number, because there is not a number n which added to its sum of digits gives 42156660656.
It is an unprimeable number.
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, 4576151 + ... + 4585353.
Almost surely, 242156660656 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 42156660656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47208567744).
42156660656 is an abundant number, since it is smaller than the sum of its proper divisors (52260474832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42156660656 is a wasteful number, since it uses less digits than its factorization.
42156660656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10770 (or 10764 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 42156660656 in words is "forty-two billion, one hundred fifty-six million, six hundred sixty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •