Base | Representation |
---|---|
bin | 110000001101000001010101… |
… | …100011001100101101010011 |
3 | 1000210122002200122221101212212 |
4 | 300031001111203030231103 |
5 | 210241411042340133021 |
6 | 2030515531411342335 |
7 | 62440365635011625 |
oct | 6015012543145523 |
9 | 1023562618841785 |
10 | 212001021021011 |
11 | 61606145569372 |
12 | 1b93b274bb19ab |
13 | 913a7c23689c1 |
14 | 3a4cc93062c15 |
15 | 197997694485b |
hex | c0d0558ccb53 |
212001021021011 has 4 divisors (see below), whose sum is σ = 218839763634624. Its totient is φ = 205162278407400.
The previous prime is 212001021020911. The next prime is 212001021021047. The reversal of 212001021021011 is 110120120100212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212001021021011 - 210 = 212001021019987 is a prime.
It is a super-2 number, since 2×2120010210210112 (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 (212001021041011) 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, 3419371306760 + ... + 3419371306821.
It is an arithmetic number, because the mean of its divisors is an integer number (54709940908656).
Almost surely, 2212001021021011 is an apocalyptic number.
212001021021011 is a deficient number, since it is larger than the sum of its proper divisors (6838742613613).
212001021021011 is an equidigital number, since it uses as much as digits as its factorization.
212001021021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6838742613612.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212001021021011 its reverse (110120120100212), we get a palindrome (322121141121223).
The spelling of 212001021021011 in words is "two hundred twelve trillion, one billion, twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •