Base | Representation |
---|---|
bin | 10001101000110111011… |
… | …001011110000100100010 |
3 | 11021212200001012001211221 |
4 | 101220313121132010202 |
5 | 124324400202413442 |
6 | 2324500304125254 |
7 | 153400135466602 |
oct | 21506731360442 |
9 | 4255601161757 |
10 | 1212110201122 |
11 | 428064677477 |
12 | 176ab930682a |
13 | 8a3bc5252a2 |
14 | 42948a30c02 |
15 | 217e2e78467 |
hex | 11a3765e122 |
1212110201122 has 24 divisors (see below), whose sum is σ = 1973215569348. Its totient is φ = 556492462080.
The previous prime is 1212110201111. The next prime is 1212110201131. The reversal of 1212110201122 is 2211020112121.
It can be written as a sum of positive squares in 6 ways, for example, as 74643157681 + 1137467043441 = 273209^2 + 1066521^2 .
It is a super-2 number, since 2×12121102011222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212110201096 and 1212110201105.
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 11 ways as a sum of consecutive naturals, for example, 10546743 + ... + 10661050.
Almost surely, 21212110201122 is an apocalyptic number.
1212110201122 is a deficient number, since it is larger than the sum of its proper divisors (761105368226).
1212110201122 is a wasteful number, since it uses less digits than its factorization.
1212110201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21207894 (or 21207853 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1212110201122 its reverse (2211020112121), we get a palindrome (3423130313243).
The spelling of 1212110201122 in words is "one trillion, two hundred twelve billion, one hundred ten million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •