Base | Representation |
---|---|
bin | 110000001110110001000101… |
… | …100001011111001000010100 |
3 | 1000211001120101222200010022101 |
4 | 300032301011201133020110 |
5 | 210300342312333033022 |
6 | 2031051014114011444 |
7 | 62452144254616615 |
oct | 6016610541371024 |
9 | 1024046358603271 |
10 | 212121011221012 |
11 | 6165201993a613 |
12 | 1b95a581576b84 |
13 | 9148c0550154a |
14 | 3a549d6d77c0c |
15 | 197cb4ab11627 |
hex | c0ec4585f214 |
212121011221012 has 6 divisors (see below), whose sum is σ = 371211769636778. Its totient is φ = 106060505610504.
The previous prime is 212121011220967. The next prime is 212121011221013. The reversal of 212121011221012 is 210122110121212.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 211998142744336 + 122868476676 = 14560156^2 + 350526^2 .
It is a super-3 number, since 3×2121210112210123 (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 not an unprimeable number, because it can be changed into a prime (212121011221013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26515126402623 + ... + 26515126402630.
Almost surely, 2212121011221012 is an apocalyptic number.
It is an amenable number.
212121011221012 is a deficient number, since it is larger than the sum of its proper divisors (159090758415766).
212121011221012 is a wasteful number, since it uses less digits than its factorization.
212121011221012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53030252805257 (or 53030252805255 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 212121011221012 its reverse (210122110121212), we get a palindrome (422243121342224).
The spelling of 212121011221012 in words is "two hundred twelve trillion, one hundred twenty-one billion, eleven million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •