Base | Representation |
---|---|
bin | 1011000110110101010010… |
… | …1000110111000111110010 |
3 | 1121020110100010002122021021 |
4 | 2301231110220313013302 |
5 | 3100040200034121320 |
6 | 41550042035250054 |
7 | 2400201020315422 |
oct | 261552450670762 |
9 | 47213303078237 |
10 | 12212012020210 |
11 | 39890a3467632 |
12 | 145292a14992a |
13 | 6a77844c1812 |
14 | 3030c912a482 |
15 | 1629e0bdbdaa |
hex | b1b54a371f2 |
12212012020210 has 8 divisors (see below), whose sum is σ = 21981621636396. Its totient is φ = 4884804808080.
The previous prime is 12212012020207. The next prime is 12212012020217. The reversal of 12212012020210 is 1202021021221.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 12208294557369 + 3717462841 = 3494037^2 + 60971^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (12212012020217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 610600601001 + ... + 610600601020.
Almost surely, 212212012020210 is an apocalyptic number.
12212012020210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12212012020210 is a deficient number, since it is larger than the sum of its proper divisors (9769609616186).
12212012020210 is a wasteful number, since it uses less digits than its factorization.
12212012020210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1221201202028.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12212012020210 its reverse (1202021021221), we get a palindrome (13414033041431).
The spelling of 12212012020210 in words is "twelve trillion, two hundred twelve billion, twelve million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •