Base | Representation |
---|---|
bin | 110000001101000010010000… |
… | …000001011000001110000011 |
3 | 1000210122012020000211212011211 |
4 | 300031002100001120032003 |
5 | 210241420100003323021 |
6 | 2030520213013350551 |
7 | 62440432146206032 |
oct | 6015022001301603 |
9 | 1023565200755154 |
10 | 212002002011011 |
11 | 616065a9288703 |
12 | 1b93b4a9638457 |
13 | 913a91a67b264 |
14 | 3a4cd47462719 |
15 | 19799d2b1d3e1 |
hex | c0d090058383 |
212002002011011 has 8 divisors (see below), whose sum is σ = 214969172208320. Its totient is φ = 209041921827648.
The previous prime is 212002002010993. The next prime is 212002002011027. The reversal of 212002002011011 is 110110200200212.
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 212002002011011 - 227 = 212001867793283 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212002002010982 and 212002002011000.
It is not an unprimeable number, because it can be changed into a prime (212002002011071) 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, 1772443266 + ... + 1772562871.
It is an arithmetic number, because the mean of its divisors is an integer number (26871146526040).
Almost surely, 2212002002011011 is an apocalyptic number.
212002002011011 is a deficient number, since it is larger than the sum of its proper divisors (2967170197309).
212002002011011 is an equidigital number, since it uses as much as digits as its factorization.
212002002011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3545006973.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 212002002011011 its reverse (110110200200212), we get a palindrome (322112202211223).
The spelling of 212002002011011 in words is "two hundred twelve trillion, two billion, two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •