Base | Representation |
---|---|
bin | 101101101111110110010010… |
… | …100000101011001011000101 |
3 | 222101101112212221121001021210 |
4 | 231233312102200223023011 |
5 | 202332431002430120401 |
6 | 1551530032450402033 |
7 | 60244143354544143 |
oct | 5557662240531305 |
9 | 871345787531253 |
10 | 201200201020101 |
11 | 59121587219858 |
12 | 1a695b44290319 |
13 | 88361363ca29a |
14 | 37981dab18593 |
15 | 183da2b7364d6 |
hex | b6fd9282b2c5 |
201200201020101 has 4 divisors (see below), whose sum is σ = 268266934693472. Its totient is φ = 134133467346732.
The previous prime is 201200201020087. The next prime is 201200201020139. The reversal of 201200201020101 is 101020102002102.
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 not a de Polignac number, because 201200201020101 - 27 = 201200201019973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200201020901) 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, 33533366836681 + ... + 33533366836686.
It is an arithmetic number, because the mean of its divisors is an integer number (67066733673368).
Almost surely, 2201200201020101 is an apocalyptic number.
It is an amenable number.
201200201020101 is a deficient number, since it is larger than the sum of its proper divisors (67066733673371).
201200201020101 is an equidigital number, since it uses as much as digits as its factorization.
201200201020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67066733673370.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201200201020101 its reverse (101020102002102), we get a palindrome (302220303022203).
The spelling of 201200201020101 in words is "two hundred one trillion, two hundred billion, two hundred one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •