Base | Representation |
---|---|
bin | 110000001101000001100000… |
… | …001101111111001100011011 |
3 | 1000210122010011010201222122002 |
4 | 300031001200031333030123 |
5 | 210241411424200310021 |
6 | 2030520001243551215 |
7 | 62440403240256506 |
oct | 6015014015771433 |
9 | 1023563133658562 |
10 | 212001200010011 |
11 | 61606227600465 |
12 | 1b93b304b2b50b |
13 | 913a820477659 |
14 | 3a4ccacb3613d |
15 | 19799874ed50b |
hex | c0d06037f31b |
212001200010011 has 8 divisors (see below), whose sum is σ = 213407996717664. Its totient is φ = 210596038165120.
The previous prime is 212001200009957. The next prime is 212001200010013. The reversal of 212001200010011 is 110010002100212.
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 212001200010011 - 222 = 212001195815707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212001200009974 and 212001200010001.
It is not an unprimeable number, because it can be changed into a prime (212001200010013) 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, 408455480 + ... + 408974181.
It is an arithmetic number, because the mean of its divisors is an integer number (26675999589708).
Almost surely, 2212001200010011 is an apocalyptic number.
212001200010011 is a deficient number, since it is larger than the sum of its proper divisors (1406796707653).
212001200010011 is a wasteful number, since it uses less digits than its factorization.
212001200010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 817431381.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 212001200010011 its reverse (110010002100212), we get a palindrome (322011202110223).
The spelling of 212001200010011 in words is "two hundred twelve trillion, one billion, two hundred million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •