Base | Representation |
---|---|
bin | 101101101101001110101010… |
… | …001101110101111000111011 |
3 | 222100202100022001221110001110 |
4 | 231231032222031311320323 |
5 | 202322003342242010021 |
6 | 1551311224252451403 |
7 | 60225142126213215 |
oct | 5555165215657073 |
9 | 870670261843043 |
10 | 201020210110011 |
11 | 59062213025aa6 |
12 | 1a667091779b63 |
13 | 88221806192a6 |
14 | 378d6042075b5 |
15 | 1838ee4c26476 |
hex | b6d3aa375e3b |
201020210110011 has 8 divisors (see below), whose sum is σ = 272027349004864. Its totient is φ = 132013272310920.
The previous prime is 201020210110001. The next prime is 201020210110133. The reversal of 201020210110011 is 110011012020102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201020210110011 - 218 = 201020209847867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201020210110001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500050273705 + ... + 500050274106.
It is an arithmetic number, because the mean of its divisors is an integer number (34003418625608).
Almost surely, 2201020210110011 is an apocalyptic number.
201020210110011 is a deficient number, since it is larger than the sum of its proper divisors (71007138894853).
201020210110011 is a wasteful number, since it uses less digits than its factorization.
201020210110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000100547881.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201020210110011 its reverse (110011012020102), we get a palindrome (311031222130113).
The spelling of 201020210110011 in words is "two hundred one trillion, twenty billion, two hundred ten million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •