Base | Representation |
---|---|
bin | 1110001101110111101… |
… | …0101111101101010000 |
3 | 212100102121011021011222 |
4 | 3203131322233231100 |
5 | 13000201240124242 |
6 | 304111455224212 |
7 | 23434346035232 |
oct | 3433572575520 |
9 | 770377137158 |
10 | 244241333072 |
11 | 94644957590 |
12 | 3b403b18068 |
13 | 1a054cbc979 |
14 | bb6daa4252 |
15 | 65474a25d2 |
hex | 38ddeafb50 |
244241333072 has 80 divisors (see below), whose sum is σ = 520012324224. Its totient is φ = 110208000000.
The previous prime is 244241333071. The next prime is 244241333113. The reversal of 244241333072 is 270333142442.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244241333071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61043072 + ... + 61047072.
Almost surely, 2244241333072 is an apocalyptic number.
244241333072 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 244241333072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260006162112).
244241333072 is an abundant number, since it is smaller than the sum of its proper divisors (275770991152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
244241333072 is a wasteful number, since it uses less digits than its factorization.
244241333072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6468 (or 6462 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 35.
The spelling of 244241333072 in words is "two hundred forty-four billion, two hundred forty-one million, three hundred thirty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •