Base | Representation |
---|---|
bin | 110110111100100100001000… |
… | …101001111110001100000000 |
3 | 1011200122010121121011102102010 |
4 | 312330210020221332030000 |
5 | 223133244432403123132 |
6 | 2213543242051452520 |
7 | 101621050566225000 |
oct | 6674441051761400 |
9 | 1150563547142363 |
10 | 241656480129792 |
11 | 6aaa9a35075322 |
12 | 2312a78a2b7140 |
13 | a4ac153c03c00 |
14 | 43963439cc000 |
15 | 1ce108daad6cc |
hex | dbc908a7e300 |
241656480129792 has 3456 divisors, whose sum is σ = 889652458598400. Its totient is φ = 58025870622720.
The previous prime is 241656480129791. The next prime is 241656480129817. The reversal of 241656480129792 is 297921084656142.
It is not an unprimeable number, because it can be changed into a prime (241656480129791) by changing a digit.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 3310362741468 + ... + 3310362741540.
It is an arithmetic number, because the mean of its divisors is an integer number (257422586400).
Almost surely, 2241656480129792 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 241656480129792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (444826229299200).
241656480129792 is an abundant number, since it is smaller than the sum of its proper divisors (647995978468608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241656480129792 is a wasteful number, since it uses less digits than its factorization.
241656480129792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276 (or 235 counting only the distinct ones).
The product of its (nonzero) digits is 104509440, while the sum is 66.
The spelling of 241656480129792 in words is "two hundred forty-one trillion, six hundred fifty-six billion, four hundred eighty million, one hundred twenty-nine thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •