Base | Representation |
---|---|
bin | 110000001101000001011010… |
… | …010100101101101011110001 |
3 | 1000210122002220020122100022202 |
4 | 300031001122110231223301 |
5 | 210241411223341010001 |
6 | 2030515543352112545 |
7 | 62440400626525340 |
oct | 6015013224555361 |
9 | 1023562806570282 |
10 | 212001101110001 |
11 | 616061867a0415 |
12 | 1b93b297995755 |
13 | 913a805b2a738 |
14 | 3a4cc9d94db57 |
15 | 197997d9b496b |
hex | c0d05a52daf1 |
212001101110001 has 4 divisors (see below), whose sum is σ = 242286972697152. Its totient is φ = 181715229522852.
The previous prime is 212001101109997. The next prime is 212001101110027. The reversal of 212001101110001 is 100011101100212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212001101110001 - 22 = 212001101109997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212001101110061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15142935793565 + ... + 15142935793578.
It is an arithmetic number, because the mean of its divisors is an integer number (60571743174288).
Almost surely, 2212001101110001 is an apocalyptic number.
It is an amenable number.
212001101110001 is a deficient number, since it is larger than the sum of its proper divisors (30285871587151).
212001101110001 is an equidigital number, since it uses as much as digits as its factorization.
212001101110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30285871587150.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 212001101110001 its reverse (100011101100212), we get a palindrome (312012202210213).
The spelling of 212001101110001 in words is "two hundred twelve trillion, one billion, one hundred one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •