Base | Representation |
---|---|
bin | 110000001110011101101101… |
… | …000101101111101100110011 |
3 | 1000210222120200122001202202211 |
4 | 300032131231011233230303 |
5 | 210300022202222413021 |
6 | 2031033253053352551 |
7 | 62450506454101123 |
oct | 6016355505575463 |
9 | 1023876618052684 |
10 | 212100200201011 |
11 | 6164420a633231 |
12 | 1b956533a98757 |
13 | 9146c69ab5b25 |
14 | 3a539c1098c83 |
15 | 197c32da933e1 |
hex | c0e76d16fb33 |
212100200201011 has 8 divisors (see below), whose sum is σ = 213653760240960. Its totient is φ = 210546718181568.
The previous prime is 212100200201009. The next prime is 212100200201041. The reversal of 212100200201011 is 110102002001212.
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 212100200201011 - 21 = 212100200201009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212100200200982 and 212100200201000.
It is not an unprimeable number, because it can be changed into a prime (212100200201041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14042596 + ... + 24927793.
It is an arithmetic number, because the mean of its divisors is an integer number (26706720030120).
Almost surely, 2212100200201011 is an apocalyptic number.
212100200201011 is a deficient number, since it is larger than the sum of its proper divisors (1553560039949).
212100200201011 is a wasteful number, since it uses less digits than its factorization.
212100200201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39010253.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 212100200201011 its reverse (110102002001212), we get a palindrome (322202202202223).
The spelling of 212100200201011 in words is "two hundred twelve trillion, one hundred billion, two hundred million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •