Base | Representation |
---|---|
bin | 10000100110101010010… |
… | …101001000110011011000 |
3 | 11001002011220221221212002 |
4 | 100212222111020303120 |
5 | 122143304121014430 |
6 | 2232102412140132 |
7 | 145302431661464 |
oct | 20465225106330 |
9 | 4032156857762 |
10 | 1141024001240 |
11 | 3aa9a6336352 |
12 | 16517a767648 |
13 | 837a104c416 |
14 | 3d323a6d4a4 |
15 | 1ea3230a845 |
hex | 109aa548cd8 |
1141024001240 has 64 divisors (see below), whose sum is σ = 2648205316800. Its totient is φ = 442134885888.
The previous prime is 1141024001233. The next prime is 1141024001263. The reversal of 1141024001240 is 421004201411.
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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1344404 + ... + 2022243.
It is an arithmetic number, because the mean of its divisors is an integer number (41378208075).
Almost surely, 21141024001240 is an apocalyptic number.
1141024001240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1141024001240 is an abundant number, since it is smaller than the sum of its proper divisors (1507181315560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1141024001240 is a wasteful number, since it uses less digits than its factorization.
1141024001240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3366924 (or 3366920 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1141024001240 its reverse (421004201411), we get a palindrome (1562028202651).
The spelling of 1141024001240 in words is "one trillion, one hundred forty-one billion, twenty-four million, one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •