Base | Representation |
---|---|
bin | 110000001110011101101101… |
… | …000100111110101001100101 |
3 | 1000210222120200121200120011201 |
4 | 300032131231010332221211 |
5 | 210300022202200000401 |
6 | 2031033253045202501 |
7 | 62450506452303310 |
oct | 6016355504765145 |
9 | 1023876617616151 |
10 | 212100200000101 |
11 | 6164420a506296 |
12 | 1b956533a00431 |
13 | 9146c69a4554a |
14 | 3a539c1045977 |
15 | 197c32da53b01 |
hex | c0e76d13ea65 |
212100200000101 has 8 divisors (see below), whose sum is σ = 242657827121664. Its totient is φ = 181606972516080.
The previous prime is 212100200000053. The next prime is 212100200000113. The reversal of 212100200000101 is 101000002001212.
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 212100200000101 - 215 = 212100199967333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212100200000131) 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, 16099902325 + ... + 16099915498.
It is an arithmetic number, because the mean of its divisors is an integer number (30332228390208).
Almost surely, 2212100200000101 is an apocalyptic number.
It is an amenable number.
212100200000101 is a deficient number, since it is larger than the sum of its proper divisors (30557627121563).
212100200000101 is an equidigital number, since it uses as much as digits as its factorization.
212100200000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32199818771.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 212100200000101 its reverse (101000002001212), we get a palindrome (313100202001313).
The spelling of 212100200000101 in words is "two hundred twelve trillion, one hundred billion, two hundred million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •