Base | Representation |
---|---|
bin | 10000100101111001010… |
… | …111000100011100110000 |
3 | 11001000001200000111220120 |
4 | 100211321113010130300 |
5 | 122140113310032422 |
6 | 2231445103010240 |
7 | 145243164460053 |
oct | 20457127043460 |
9 | 4030050014816 |
10 | 1140202424112 |
11 | 3aa6145a8294 |
12 | 164b8b599980 |
13 | 8369ca832cb |
14 | 3d2868c8a9a |
15 | 1e9d512045c |
hex | 109795c4730 |
1140202424112 has 80 divisors (see below), whose sum is σ = 3016584426240. Its totient is φ = 371004256000.
The previous prime is 1140202424089. The next prime is 1140202424147. The reversal of 1140202424112 is 2114242020411.
It is a happy number.
It is a super-2 number, since 2×11402024241122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1312062 + ... + 2000477.
It is an arithmetic number, because the mean of its divisors is an integer number (37707305328).
Almost surely, 21140202424112 is an apocalyptic number.
1140202424112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1140202424112 is an abundant number, since it is smaller than the sum of its proper divisors (1876382002128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140202424112 is a wasteful number, since it uses less digits than its factorization.
1140202424112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3312722 (or 3312716 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 1140202424112 its reverse (2114242020411), we get a palindrome (3254444444523).
The spelling of 1140202424112 in words is "one trillion, one hundred forty billion, two hundred two million, four hundred twenty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •