Base | Representation |
---|---|
bin | 1100010110100011010… |
… | …1101100000010110001 |
3 | 202021202102212220102221 |
4 | 3011220311230002301 |
5 | 11434102322131001 |
6 | 241253342041041 |
7 | 21221550543010 |
oct | 3055065540261 |
9 | 667672786387 |
10 | 212212302001 |
11 | 81aa9348477 |
12 | 35165579181 |
13 | 1701c45758b |
14 | a3b1da4a77 |
15 | 57c067e1a1 |
hex | 3168d6c0b1 |
212212302001 has 8 divisors (see below), whose sum is σ = 244929616704. Its totient is φ = 180095305200.
The previous prime is 212212301993. The next prime is 212212302019. The reversal of 212212302001 is 100203212212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212212302001 - 23 = 212212301993 is a prime.
It is a super-2 number, since 2×2122123020012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212212302031) 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 7 ways as a sum of consecutive naturals, for example, 150078715 + ... + 150080128.
It is an arithmetic number, because the mean of its divisors is an integer number (30616202088).
Almost surely, 2212212302001 is an apocalyptic number.
It is an amenable number.
212212302001 is a deficient number, since it is larger than the sum of its proper divisors (32717314703).
212212302001 is a wasteful number, since it uses less digits than its factorization.
212212302001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300158951.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 212212302001 its reverse (100203212212), we get a palindrome (312415514213).
The spelling of 212212302001 in words is "two hundred twelve billion, two hundred twelve million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •