Base | Representation |
---|---|
bin | 1100010110001010111… |
… | …1111001100000101001 |
3 | 202021111022121120110110 |
4 | 3011202233321200221 |
5 | 11433400142333001 |
6 | 241235252004533 |
7 | 21216200165142 |
oct | 3054257714051 |
9 | 667438546413 |
10 | 212110121001 |
11 | 81a566a7369 |
12 | 35137300749 |
13 | 1700422c14c |
14 | a3a25a6ac9 |
15 | 57b66e83d6 |
hex | 3162bf9829 |
212110121001 has 32 divisors (see below), whose sum is σ = 305822723200. Its totient is φ = 130310208000.
The previous prime is 212110120969. The next prime is 212110121029. The reversal of 212110121001 is 100121011212.
212110121001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212110121001 - 25 = 212110120969 is a prime.
It is a super-2 number, since 2×2121101210012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (212110121051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10089501 + ... + 10110501.
It is an arithmetic number, because the mean of its divisors is an integer number (9556960100).
Almost surely, 2212110121001 is an apocalyptic number.
It is an amenable number.
212110121001 is a deficient number, since it is larger than the sum of its proper divisors (93712602199).
212110121001 is a wasteful number, since it uses less digits than its factorization.
212110121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25849.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 212110121001 its reverse (100121011212), we get a palindrome (312231132213).
The spelling of 212110121001 in words is "two hundred twelve billion, one hundred ten million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •