Base | Representation |
---|---|
bin | 11101110000000001001… |
… | …10000101111011100100 |
3 | 10121201111201121012200001 |
4 | 32320000212011323210 |
5 | 113221442310432322 |
6 | 2101333043031044 |
7 | 133565241233035 |
oct | 16700046057344 |
9 | 3551451535601 |
10 | 1022212202212 |
11 | 364577159203 |
12 | 14614096b484 |
13 | 75518087b66 |
14 | 37692464a8c |
15 | 1b8cb80e827 |
hex | ee00985ee4 |
1022212202212 has 48 divisors (see below), whose sum is σ = 1896158139120. Its totient is φ = 481327257600.
The previous prime is 1022212202191. The next prime is 1022212202213. The reversal of 1022212202212 is 2122022122201.
It can be written as a sum of positive squares in 8 ways, for example, as 28793338596 + 993418863616 = 169686^2 + 996704^2 .
It is a super-2 number, since 2×10222122022122 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1022212202212.
It is not an unprimeable number, because it can be changed into a prime (1022212202213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21097198 + ... + 21145594.
It is an arithmetic number, because the mean of its divisors is an integer number (39503294565).
Almost surely, 21022212202212 is an apocalyptic number.
It is an amenable number.
1022212202212 is a deficient number, since it is larger than the sum of its proper divisors (873945936908).
1022212202212 is a wasteful number, since it uses less digits than its factorization.
1022212202212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52912 (or 52910 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 1022212202212 its reverse (2122022122201), we get a palindrome (3144234324413).
The spelling of 1022212202212 in words is "one trillion, twenty-two billion, two hundred twelve million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •