Base | Representation |
---|---|
bin | 110000001110110001000101… |
… | …100001000100000001110001 |
3 | 1000211001120101222110111000212 |
4 | 300032301011201010001301 |
5 | 210300342312321010001 |
6 | 2031051014111353505 |
7 | 62452144253645150 |
oct | 6016610541040161 |
9 | 1024046358414025 |
10 | 212121011110001 |
11 | 61652019874174 |
12 | 1b95a581522895 |
13 | 9148c05492b66 |
14 | 3a549d6d49597 |
15 | 197cb4aadd7bb |
hex | c0ec45844071 |
212121011110001 has 16 divisors (see below), whose sum is σ = 242951914867200. Its totient is φ = 181422089513280.
The previous prime is 212121011109971. The next prime is 212121011110061. The reversal of 212121011110001 is 100011110121212.
It is not a de Polignac number, because 212121011110001 - 226 = 212120944001137 is a prime.
It is a super-3 number, since 3×2121210111100013 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (212121011110061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 563365400 + ... + 563741798.
It is an arithmetic number, because the mean of its divisors is an integer number (15184494679200).
Almost surely, 2212121011110001 is an apocalyptic number.
It is an amenable number.
212121011110001 is a deficient number, since it is larger than the sum of its proper divisors (30830903757199).
212121011110001 is a wasteful number, since it uses less digits than its factorization.
212121011110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551504.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 212121011110001 its reverse (100011110121212), we get a palindrome (312132121231213).
The spelling of 212121011110001 in words is "two hundred twelve trillion, one hundred twenty-one billion, eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •