Base | Representation |
---|---|
bin | 11101001110111001100… |
… | …10100001111000000100 |
3 | 10120000121120021201021022 |
4 | 32213130302201320010 |
5 | 112424033443112234 |
6 | 2045232435210312 |
7 | 132365515562600 |
oct | 16473462417004 |
9 | 3500546251238 |
10 | 1004431613444 |
11 | 357a82507746 |
12 | 1427ba146998 |
13 | 7394344a00c |
14 | 36886c30500 |
15 | 1b1da846e2e |
hex | e9dcca1e04 |
1004431613444 has 36 divisors (see below), whose sum is σ = 2045285899776. Its totient is φ = 430354877904.
The previous prime is 1004431613417. The next prime is 1004431613453. The reversal of 1004431613444 is 4443161344001.
It is a super-2 number, since 2×10044316134442 (a number of 25 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 42989 + ... + 1417995.
It is an arithmetic number, because the mean of its divisors is an integer number (56813497216).
Almost surely, 21004431613444 is an apocalyptic number.
1004431613444 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1004431613444 is an abundant number, since it is smaller than the sum of its proper divisors (1040854286332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004431613444 is a wasteful number, since it uses less digits than its factorization.
1004431613444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1378752 (or 1378743 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 35.
Adding to 1004431613444 its reverse (4443161344001), we get a palindrome (5447592957445).
The spelling of 1004431613444 in words is "one trillion, four billion, four hundred thirty-one million, six hundred thirteen thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •