Base | Representation |
---|---|
bin | 110000001110011110011100… |
… | …110001100010011001010001 |
3 | 1000210222122202101102102210102 |
4 | 300032132130301202121101 |
5 | 210300030322023210001 |
6 | 2031033504312342145 |
7 | 62450535340052630 |
oct | 6016363461423121 |
9 | 1023878671372712 |
10 | 212101000210001 |
11 | 6164459017a891 |
12 | 1b9567179a4955 |
13 | 914706676cb26 |
14 | 3a53a59427517 |
15 | 197c378e1ce6b |
hex | c0e79cc62651 |
212101000210001 has 8 divisors (see below), whose sum is σ = 242415664355904. Its totient is φ = 181789966378800.
The previous prime is 212101000209971. The next prime is 212101000210013. The reversal of 212101000210001 is 100012000101212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212101000210001 is a prime.
It is a super-2 number, since 2×2121010002100012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212101000210901) 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, 907453475 + ... + 907687176.
It is an arithmetic number, because the mean of its divisors is an integer number (30301958044488).
Almost surely, 2212101000210001 is an apocalyptic number.
It is an amenable number.
212101000210001 is a deficient number, since it is larger than the sum of its proper divisors (30314664145903).
212101000210001 is a wasteful number, since it uses less digits than its factorization.
212101000210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1815157351.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 212101000210001 its reverse (100012000101212), we get a palindrome (312113000311213).
The spelling of 212101000210001 in words is "two hundred twelve trillion, one hundred one billion, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •