Base | Representation |
---|---|
bin | 10011011001010011101101… |
… | …01010011101100010000100 |
3 | 12121000101201122101220021112 |
4 | 21230221312222131202010 |
5 | 21042243240104414110 |
6 | 230413334543304152 |
7 | 11661301640034215 |
oct | 1154516652354204 |
9 | 177011648356245 |
10 | 42651016091780 |
11 | 12654215746278 |
12 | 494a076bab058 |
13 | 1aa4c86bab795 |
14 | a7646a87940c |
15 | 4de6b671b405 |
hex | 26ca76a9d884 |
42651016091780 has 108 divisors (see below), whose sum is σ = 97901347978980. Its totient is φ = 15605160834816.
The previous prime is 42651016091731. The next prime is 42651016091851. The reversal of 42651016091780 is 8719061015624.
It can be written as a sum of positive squares in 6 ways, for example, as 32497993984 + 42618518097796 = 180272^2 + 6528286^2 .
It is a super-2 number, since 2×426510160917802 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2559926 + ... + 9584114.
Almost surely, 242651016091780 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 42651016091780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48950673989490).
42651016091780 is an abundant number, since it is smaller than the sum of its proper divisors (55250331887200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42651016091780 is a wasteful number, since it uses less digits than its factorization.
42651016091780 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7024294 (or 7024244 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 50.
The spelling of 42651016091780 in words is "forty-two trillion, six hundred fifty-one billion, sixteen million, ninety-one thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •