Base | Representation |
---|---|
bin | 110111100010010110101110… |
… | …011111001001000001100000 |
3 | 1012000211101202222111110002012 |
4 | 313202112232133021001200 |
5 | 224003322002133231412 |
6 | 2223252250120412052 |
7 | 102306504336512366 |
oct | 6742265637110140 |
9 | 1160741688443065 |
10 | 244253422555232 |
11 | 709103273a4682 |
12 | 23489b49017028 |
13 | a639cca80325c |
14 | 4445d0060d636 |
15 | 1d388d3290c22 |
hex | de25ae7c9060 |
244253422555232 has 48 divisors (see below), whose sum is σ = 496451291277312. Its totient is φ = 118171591493760.
The previous prime is 244253422555229. The next prime is 244253422555321. The reversal of 244253422555232 is 232555224352442.
It is a happy number.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 8650328 + ... + 23734679.
It is an arithmetic number, because the mean of its divisors is an integer number (10342735234944).
Almost surely, 2244253422555232 is an apocalyptic number.
It is an amenable number.
244253422555232 is an abundant number, since it is smaller than the sum of its proper divisors (252197868722080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
244253422555232 is a wasteful number, since it uses less digits than its factorization.
244253422555232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32392651 (or 32392643 counting only the distinct ones).
The product of its digits is 23040000, while the sum is 50.
The spelling of 244253422555232 in words is "two hundred forty-four trillion, two hundred fifty-three billion, four hundred twenty-two million, five hundred fifty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •