Base | Representation |
---|---|
bin | 1011000110110110000001… |
… | …1100100011011000010100 |
3 | 1121020110211220212011101101 |
4 | 2301231200130203120110 |
5 | 3100041101242321322 |
6 | 41550113433235444 |
7 | 2400205644200434 |
oct | 261554034433024 |
9 | 47213756764341 |
10 | 12212210120212 |
11 | 3989195272043 |
12 | 1452984562b84 |
13 | 6a77b656205b |
14 | 3031075762c4 |
15 | 162a032bd327 |
hex | b1b60723614 |
12212210120212 has 48 divisors (see below), whose sum is σ = 21558617167248. Its totient is φ = 6052890378240.
The previous prime is 12212210120189. The next prime is 12212210120221. The reversal of 12212210120212 is 21202101221221.
It can be written as a sum of positive squares in 8 ways, for example, as 5613605776 + 12206596514436 = 74924^2 + 3493794^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 12212210120212.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 233758558 + ... + 233810794.
It is an arithmetic number, because the mean of its divisors is an integer number (449137857651).
Almost surely, 212212210120212 is an apocalyptic number.
It is an amenable number.
12212210120212 is a deficient number, since it is larger than the sum of its proper divisors (9346407047036).
12212210120212 is a wasteful number, since it uses less digits than its factorization.
12212210120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53596 (or 53594 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12212210120212 its reverse (21202101221221), we get a palindrome (33414311341433).
The spelling of 12212210120212 in words is "twelve trillion, two hundred twelve billion, two hundred ten million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •