Base | Representation |
---|---|
bin | 101101101100111100000010… |
… | …001111011111100001010001 |
3 | 222100200102200101011100012111 |
4 | 231230330002033133201101 |
5 | 202321141413244214301 |
6 | 1551254120034025321 |
7 | 60223533430021432 |
oct | 5554740217374121 |
9 | 870612611140174 |
10 | 201000212101201 |
11 | 59054790736a97 |
12 | 1a663230418241 |
13 | 882031448aa96 |
14 | 378c6682bd489 |
15 | 1838724250551 |
hex | b6cf023df851 |
201000212101201 has 4 divisors (see below), whose sum is σ = 201419836761600. Its totient is φ = 200580587440804.
The previous prime is 201000212101193. The next prime is 201000212101211. The reversal of 201000212101201 is 102101212000102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201000212101201 - 23 = 201000212101193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201000212101211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209812329481 + ... + 209812330438.
It is an arithmetic number, because the mean of its divisors is an integer number (50354959190400).
Almost surely, 2201000212101201 is an apocalyptic number.
It is an amenable number.
201000212101201 is a deficient number, since it is larger than the sum of its proper divisors (419624660399).
201000212101201 is an equidigital number, since it uses as much as digits as its factorization.
201000212101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419624660398.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201000212101201 its reverse (102101212000102), we get a palindrome (303101424101303).
The spelling of 201000212101201 in words is "two hundred one trillion, two hundred twelve million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •