Base | Representation |
---|---|
bin | 1100010110100000101… |
… | …1110000111100100001 |
3 | 202021201200012120001002 |
4 | 3011220023300330201 |
5 | 11434042013441113 |
6 | 241252310321345 |
7 | 21221355251204 |
oct | 3055013607441 |
9 | 667650176032 |
10 | 212201312033 |
11 | 81aa3121557 |
12 | 35161959255 |
13 | 1701a0aa239 |
14 | a3b074393b |
15 | 57be70cc58 |
hex | 31682f0f21 |
212201312033 has 8 divisors (see below), whose sum is σ = 223435432320. Its totient is φ = 200973754800.
The previous prime is 212201312027. The next prime is 212201312047. The reversal of 212201312033 is 330213102212.
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 212201312033 - 26 = 212201311969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212201311996 and 212201312014.
It is not an unprimeable number, because it can be changed into a prime (212201312083) 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, 1574318 + ... + 1703783.
It is an arithmetic number, because the mean of its divisors is an integer number (27929429040).
Almost surely, 2212201312033 is an apocalyptic number.
It is an amenable number.
212201312033 is a deficient number, since it is larger than the sum of its proper divisors (11234120287).
212201312033 is a wasteful number, since it uses less digits than its factorization.
212201312033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3281527.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 212201312033 its reverse (330213102212), we get a palindrome (542414414245).
The spelling of 212201312033 in words is "two hundred twelve billion, two hundred one million, three hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •