Base | Representation |
---|---|
bin | 101101111011101001100110… |
… | …100010011110000010000001 |
3 | 222111021002020201001012201221 |
4 | 231323221212202132002001 |
5 | 202434222430300041001 |
6 | 1553350400352555041 |
7 | 60356554104230005 |
oct | 5573514642360201 |
9 | 874232221035657 |
10 | 202011212112001 |
11 | 594045238a78a6 |
12 | 1a7a7162252a81 |
13 | 8894763685b46 |
14 | 37c55755da705 |
15 | 1854b965591a1 |
hex | b7ba6689e081 |
202011212112001 has 8 divisors (see below), whose sum is σ = 202571216169984. Its totient is φ = 201451377636240.
The previous prime is 202011212111921. The next prime is 202011212112019. The reversal of 202011212112001 is 100211212110202.
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 202011212112001 - 245 = 166826840023169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202011212112091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40009611 + ... + 44774896.
It is an arithmetic number, because the mean of its divisors is an integer number (25321402021248).
Almost surely, 2202011212112001 is an apocalyptic number.
It is an amenable number.
202011212112001 is a deficient number, since it is larger than the sum of its proper divisors (560004057983).
202011212112001 is an equidigital number, since it uses as much as digits as its factorization.
202011212112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84791111.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 202011212112001 its reverse (100211212110202), we get a palindrome (302222424222203).
The spelling of 202011212112001 in words is "two hundred two trillion, eleven billion, two hundred twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •