Base | Representation |
---|---|
bin | 1011000110110110000100… |
… | …0110110100111001011100 |
3 | 1121020110212200201011202102 |
4 | 2301231201012310321130 |
5 | 3100041112111431022 |
6 | 41550114510544232 |
7 | 2400206140324046 |
oct | 261554106647134 |
9 | 47213780634672 |
10 | 12212221202012 |
11 | 39891a0550a57 |
12 | 1452988208078 |
13 | 6a77b8942130 |
14 | 303108c1ca96 |
15 | 162a0425ba92 |
hex | b1b611b4e5c |
12212221202012 has 24 divisors (see below), whose sum is σ = 23029662044256. Its totient is φ = 5632902335808.
The previous prime is 12212221202011. The next prime is 12212221202017. The reversal of 12212221202012 is 21020212221221.
12212221202012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×122122212020122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12212221202011) 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, 72987503 + ... + 73154630.
It is an arithmetic number, because the mean of its divisors is an integer number (959569251844).
Almost surely, 212212221202012 is an apocalyptic number.
It is an amenable number.
12212221202012 is a deficient number, since it is larger than the sum of its proper divisors (10817440842244).
12212221202012 is a wasteful number, since it uses less digits than its factorization.
12212221202012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146143757 (or 146143755 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12212221202012 its reverse (21020212221221), we get a palindrome (33232433423233).
The spelling of 12212221202012 in words is "twelve trillion, two hundred twelve billion, two hundred twenty-one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •