Base | Representation |
---|---|
bin | 11110011000101001011… |
… | …00101010001001100000 |
3 | 10200210210211220210120010 |
4 | 33030110230222021200 |
5 | 114101130210213344 |
6 | 2115341304044520 |
7 | 135266616110136 |
oct | 17142454521140 |
9 | 3623724823503 |
10 | 1044024304224 |
11 | 37284a5582a0 |
12 | 14a409763740 |
13 | 775b2ccc0b5 |
14 | 38761293756 |
15 | 1c2566c48b9 |
hex | f314b2a260 |
1044024304224 has 48 divisors (see below), whose sum is σ = 2989705965120. Its totient is φ = 316371000960.
The previous prime is 1044024304201. The next prime is 1044024304231. The reversal of 1044024304224 is 4224034204401.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 1044024304191 and 1044024304200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 494328634 + ... + 494330745.
It is an arithmetic number, because the mean of its divisors is an integer number (62285540940).
Almost surely, 21044024304224 is an apocalyptic number.
It is an amenable number.
1044024304224 is an abundant number, since it is smaller than the sum of its proper divisors (1945681660896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1044024304224 is a wasteful number, since it uses less digits than its factorization.
1044024304224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988659403 (or 988659395 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 30.
Adding to 1044024304224 its reverse (4224034204401), we get a palindrome (5268058508625).
The spelling of 1044024304224 in words is "one trillion, forty-four billion, twenty-four million, three hundred four thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •