Base | Representation |
---|---|
bin | 11011011001100100010… |
… | …11100011110000101000 |
3 | 10100000000112221102012021 |
4 | 31230302023203300220 |
5 | 110411032032304210 |
6 | 2000254052354224 |
7 | 125005516442023 |
oct | 15546213436050 |
9 | 3300015842167 |
10 | 941439728680 |
11 | 333298202350 |
12 | 13255a315974 |
13 | 6aa14bba319 |
14 | 337ccc881ba |
15 | 19750604bda |
hex | db322e3c28 |
941439728680 has 128 divisors (see below), whose sum is σ = 2395258387200. Its totient is φ = 329877452800.
The previous prime is 941439728653. The next prime is 941439728683. The reversal of 941439728680 is 86827934149.
It is not an unprimeable number, because it can be changed into a prime (941439728683) 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 31 ways as a sum of consecutive naturals, for example, 6344940 + ... + 6491620.
It is an arithmetic number, because the mean of its divisors is an integer number (18712956150).
Almost surely, 2941439728680 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 941439728680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1197629193600).
941439728680 is an abundant number, since it is smaller than the sum of its proper divisors (1453818658520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
941439728680 is a wasteful number, since it uses less digits than its factorization.
941439728680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147235 (or 147231 counting only the distinct ones).
The product of its (nonzero) digits is 20901888, while the sum is 61.
The spelling of 941439728680 in words is "nine hundred forty-one billion, four hundred thirty-nine million, seven hundred twenty-eight thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •