Base | Representation |
---|---|
bin | 11101001110101110110… |
… | …00111101011011000100 |
3 | 10120000101020211022112110 |
4 | 32213113120331123010 |
5 | 112423342300240302 |
6 | 2045215441421020 |
7 | 132363335565003 |
oct | 16472730753304 |
9 | 3500336738473 |
10 | 1004341024452 |
11 | 357a36363907 |
12 | 14279393a770 |
13 | 7392a74cc6c |
14 | 36878bacc3a |
15 | 1b1d2900b6c |
hex | e9d763d6c4 |
1004341024452 has 48 divisors (see below), whose sum is σ = 2383317921600. Its totient is φ = 329087341440.
The previous prime is 1004341024429. The next prime is 1004341024457. The reversal of 1004341024452 is 2544201434001.
It is not an unprimeable number, because it can be changed into a prime (1004341024457) 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, 18197074 + ... + 18252182.
It is an arithmetic number, because the mean of its divisors is an integer number (49652456700).
Almost surely, 21004341024452 is an apocalyptic number.
1004341024452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1004341024452 is an abundant number, since it is smaller than the sum of its proper divisors (1378976897148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004341024452 is a wasteful number, since it uses less digits than its factorization.
1004341024452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80916 (or 80914 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 1004341024452 its reverse (2544201434001), we get a palindrome (3548542458453).
The spelling of 1004341024452 in words is "one trillion, four billion, three hundred forty-one million, twenty-four thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •