Base | Representation |
---|---|
bin | 101101101101001110101001… |
… | …101011110110110101110011 |
3 | 222100202100021110011211012111 |
4 | 231231032221223312311303 |
5 | 202322003333001413021 |
6 | 1551311223333510151 |
7 | 60225141660406363 |
oct | 5555165153666563 |
9 | 870670243154174 |
10 | 201020201201011 |
11 | 59062208aa0595 |
12 | 1a66708a7a2357 |
13 | 882217b81a1aa |
14 | 378d602d689a3 |
15 | 1838ee40668e1 |
hex | b6d3a9af6d73 |
201020201201011 has 8 divisors (see below), whose sum is σ = 202550157678960. Its totient is φ = 199491441408768.
The previous prime is 201020201200999. The next prime is 201020201201041. The reversal of 201020201201011 is 110102102020102.
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 201020201201011 - 221 = 201020199103859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201020201200982 and 201020201201000.
It is not an unprimeable number, because it can be changed into a prime (201020201201041) 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, 298834186 + ... + 299506111.
It is an arithmetic number, because the mean of its divisors is an integer number (25318769709870).
Almost surely, 2201020201201011 is an apocalyptic number.
201020201201011 is a deficient number, since it is larger than the sum of its proper divisors (1529956477949).
201020201201011 is a wasteful number, since it uses less digits than its factorization.
201020201201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 598342853.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201020201201011 its reverse (110102102020102), we get a palindrome (311122303221113).
The spelling of 201020201201011 in words is "two hundred one trillion, twenty billion, two hundred one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •