Base | Representation |
---|---|
bin | 10001110011111100110… |
… | …111100000011000010000 |
3 | 11100000101120122001100210 |
4 | 101303330313200120100 |
5 | 130023234324333130 |
6 | 2334145345044120 |
7 | 154301120602203 |
oct | 21637467403020 |
9 | 4300346561323 |
10 | 1224013121040 |
11 | 432112551376 |
12 | 17927b626640 |
13 | 8b568529378 |
14 | 433577bb93a |
15 | 21c8ce1e5b0 |
hex | 11cfcde0610 |
1224013121040 has 80 divisors (see below), whose sum is σ = 3795270587136. Its totient is φ = 326332108800.
The previous prime is 1224013121003. The next prime is 1224013121081. The reversal of 1224013121040 is 401213104221.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 1224013120998 and 1224013121016.
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 15 ways as a sum of consecutive naturals, for example, 546400 + ... + 1657280.
Almost surely, 21224013121040 is an apocalyptic number.
1224013121040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1224013121040 is an abundant number, since it is smaller than the sum of its proper divisors (2571257466096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1224013121040 is a wasteful number, since it uses less digits than its factorization.
1224013121040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115488 (or 1115482 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1224013121040 its reverse (401213104221), we get a palindrome (1625226225261).
The spelling of 1224013121040 in words is "one trillion, two hundred twenty-four billion, thirteen million, one hundred twenty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •