Base | Representation |
---|---|
bin | 10000100111101011101… |
… | …101111100101011010100 |
3 | 11001012000101012111110112 |
4 | 100213223231330223110 |
5 | 122203030440233322 |
6 | 2232403321142152 |
7 | 145341552345260 |
oct | 20475355745324 |
9 | 4035011174415 |
10 | 1142121024212 |
11 | 4004095a7a03 |
12 | 16542602a958 |
13 | 839173ca03c |
14 | 3d3c96350a0 |
15 | 1ea987a45e2 |
hex | 109ebb7cad4 |
1142121024212 has 12 divisors (see below), whose sum is σ = 2284242048480. Its totient is φ = 489480438936.
The previous prime is 1142121024127. The next prime is 1142121024307. The reversal of 1142121024212 is 2124201212411.
1142121024212 is an admirable number.
It is a super-3 number, since 3×11421210242123 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 20395018262 + ... + 20395018317.
It is an arithmetic number, because the mean of its divisors is an integer number (190353504040).
Almost surely, 21142121024212 is an apocalyptic number.
It is an amenable number.
1142121024212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142121024212 is a wasteful number, since it uses less digits than its factorization.
1142121024212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40790036590 (or 40790036588 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 1142121024212 its reverse (2124201212411), we get a palindrome (3266322236623).
The spelling of 1142121024212 in words is "one trillion, one hundred forty-two billion, one hundred twenty-one million, twenty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •