Base | Representation |
---|---|
bin | 100011100001101010101… |
… | …011111010010011000000 |
3 | 22122101111120120211011112 |
4 | 203201222223322103000 |
5 | 304444321304220000 |
6 | 5105310534502452 |
7 | 341244315554216 |
oct | 43415253722300 |
9 | 8571446524145 |
10 | 2441331320000 |
11 | 8613a9980691 |
12 | 335190b04a28 |
13 | 1492a7a07981 |
14 | 86237d74cb6 |
15 | 437881d8235 |
hex | 2386aafa4c0 |
2441331320000 has 140 divisors (see below), whose sum is σ = 6316915327536. Its totient is φ = 934074240000.
The previous prime is 2441331319997. The next prime is 2441331320039. The reversal of 2441331320000 is 231331442.
It is a super-2 number, since 2×24413313200002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 406811 + ... + 2246810.
Almost surely, 22441331320000 is an apocalyptic number.
2441331320000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2441331320000 is an abundant number, since it is smaller than the sum of its proper divisors (3875584007536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2441331320000 is an equidigital number, since it uses as much as digits as its factorization.
2441331320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2653676 (or 2653651 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2441331320000 its reverse (231331442), we get a palindrome (2441562651442).
The spelling of 2441331320000 in words is "two trillion, four hundred forty-one billion, three hundred thirty-one million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •