Base | Representation |
---|---|
bin | 10000010100111101000… |
… | …000100011110101011100 |
3 | 10222021002210210200201120 |
4 | 100110331000203311130 |
5 | 121340334031134322 |
6 | 2215235544410540 |
7 | 144030311551413 |
oct | 20247500436534 |
9 | 3867083720646 |
10 | 1122010021212 |
11 | 3a2929451773 |
12 | 161552a76a50 |
13 | 81a60a28672 |
14 | 3c43c6d647a |
15 | 1e2bce0da5c |
hex | 1053d023d5c |
1122010021212 has 24 divisors (see below), whose sum is σ = 2702475750912. Its totient is φ = 361938716400.
The previous prime is 1122010021193. The next prime is 1122010021213. The reversal of 1122010021212 is 2121200102211.
It is a junction number, because it is equal to n+sod(n) for n = 1122010021191 and 1122010021200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122010021213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1508077614 + ... + 1508078357.
It is an arithmetic number, because the mean of its divisors is an integer number (112603156288).
Almost surely, 21122010021212 is an apocalyptic number.
1122010021212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122010021212 is an abundant number, since it is smaller than the sum of its proper divisors (1580465729700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122010021212 is a wasteful number, since it uses less digits than its factorization.
1122010021212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3016156009 (or 3016156007 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1122010021212 its reverse (2121200102211), we get a palindrome (3243210123423).
The spelling of 1122010021212 in words is "one trillion, one hundred twenty-two billion, ten million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •