Base | Representation |
---|---|
bin | 110000001110110001010001… |
… | …100000001100111100111001 |
3 | 1000211001120220222212110202001 |
4 | 300032301101200030330321 |
5 | 210300343220311223001 |
6 | 2031051050053541001 |
7 | 62452152245166352 |
oct | 6016612140147471 |
9 | 1024046828773661 |
10 | 212121212211001 |
11 | 61652112339345 |
12 | 1b95a618944761 |
13 | 9148c38044332 |
14 | 3a54a15936d29 |
15 | 197cb5d5b4001 |
hex | c0ec5180cf39 |
212121212211001 has 16 divisors (see below), whose sum is σ = 226854625795200. Its totient is φ = 197639715587328.
The previous prime is 212121212210993. The next prime is 212121212211049. The reversal of 212121212211001 is 100112212121212.
It is a happy number.
It is not a de Polignac number, because 212121212211001 - 23 = 212121212210993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212121212211001.
It is not an unprimeable number, because it can be changed into a prime (212121212211401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14777146 + ... + 25349683.
It is an arithmetic number, because the mean of its divisors is an integer number (14178414112200).
Almost surely, 2212121212211001 is an apocalyptic number.
It is an amenable number.
212121212211001 is a deficient number, since it is larger than the sum of its proper divisors (14733413584199).
212121212211001 is a wasteful number, since it uses less digits than its factorization.
212121212211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40129968.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 212121212211001 its reverse (100112212121212), we get a palindrome (312233424332213).
The spelling of 212121212211001 in words is "two hundred twelve trillion, one hundred twenty-one billion, two hundred twelve million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •