Base | Representation |
---|---|
bin | 101101101100111100110001… |
… | …110111000101101010100011 |
3 | 222100200111202001110010100002 |
4 | 231230330301313011222203 |
5 | 202321200032304311321 |
6 | 1551254331213250215 |
7 | 60223562300442266 |
oct | 5554746167055243 |
9 | 870614661403302 |
10 | 201001011010211 |
11 | 590550606a2175 |
12 | 1a663413a9396b |
13 | 8820410b4b1c9 |
14 | 378c702442cdd |
15 | 183876e45e20b |
hex | b6cf31dc5aa3 |
201001011010211 has 8 divisors (see below), whose sum is σ = 204298168351200. Its totient is φ = 197703920082240.
The previous prime is 201001011010207. The next prime is 201001011010229. The reversal of 201001011010211 is 112010110100102.
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 201001011010211 - 22 = 201001011010207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201001011010192 and 201001011010201.
It is not an unprimeable number, because it can be changed into a prime (201001011010271) 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, 10482191 + ... + 22624728.
It is an arithmetic number, because the mean of its divisors is an integer number (25537271043900).
Almost surely, 2201001011010211 is an apocalyptic number.
201001011010211 is a deficient number, since it is larger than the sum of its proper divisors (3297157340989).
201001011010211 is an equidigital number, since it uses as much as digits as its factorization.
201001011010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33206509.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201001011010211 its reverse (112010110100102), we get a palindrome (313011121110313).
The spelling of 201001011010211 in words is "two hundred one trillion, one billion, eleven million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •