Base | Representation |
---|---|
bin | 11110011000101001011… |
… | …00000010000011100000 |
3 | 10200210210211121110021202 |
4 | 33030110230002003200 |
5 | 114101130134440000 |
6 | 2115341300340332 |
7 | 135266614524302 |
oct | 17142454020340 |
9 | 3623724543252 |
10 | 1044024140000 |
11 | 37284a455976 |
12 | 14a4096a46a8 |
13 | 775b2c7241a |
14 | 3876124d972 |
15 | 1c256690dd5 |
hex | f314b020e0 |
1044024140000 has 120 divisors (see below), whose sum is σ = 2571243288768. Its totient is φ = 417156480000.
The previous prime is 1044024139969. The next prime is 1044024140011. The reversal of 1044024140000 is 414204401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 18712145 + ... + 18767855.
Almost surely, 21044024140000 is an apocalyptic number.
1044024140000 is a gapful number since it is divisible by the number (10) 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 1044024140000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1285621644384).
1044024140000 is an abundant number, since it is smaller than the sum of its proper divisors (1527219148768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1044024140000 is an frugal number, since it uses more digits than its factorization.
1044024140000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56678 (or 56655 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 1044024140000 its reverse (414204401), we get a palindrome (1044438344401).
The spelling of 1044024140000 in words is "one trillion, forty-four billion, twenty-four million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •