Base | Representation |
---|---|
bin | 110000001110110001001010… |
… | …111000000010111101010100 |
3 | 1000211001120122020122102202022 |
4 | 300032301022320002331110 |
5 | 210300343003330133022 |
6 | 2031051031042432312 |
7 | 62452146425120321 |
oct | 6016611270027524 |
9 | 1024046566572668 |
10 | 212121101021012 |
11 | 616520655a4697 |
12 | 1b95a5a7662698 |
13 | 9148c1acb3441 |
14 | 3a54a04c71b48 |
15 | 197cb5394dc42 |
hex | c0ec4ae02f54 |
212121101021012 has 12 divisors (see below), whose sum is σ = 371218046660916. Its totient is φ = 106058801975040.
The previous prime is 212121101021009. The next prime is 212121101021023. The reversal of 212121101021012 is 210120101121212.
It can be written as a sum of positive squares in 2 ways, for example, as 25788663688516 + 186332437332496 = 5078254^2 + 13650364^2 .
It is a super-3 number, since 3×2121211010210123 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 436860893 + ... + 437346180.
It is an arithmetic number, because the mean of its divisors is an integer number (30934837221743).
Almost surely, 2212121101021012 is an apocalyptic number.
It is an amenable number.
212121101021012 is a deficient number, since it is larger than the sum of its proper divisors (159096945639904).
212121101021012 is a wasteful number, since it uses less digits than its factorization.
212121101021012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874267738 (or 874267736 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 212121101021012 its reverse (210120101121212), we get a palindrome (422241202142224).
The spelling of 212121101021012 in words is "two hundred twelve trillion, one hundred twenty-one billion, one hundred one million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •