Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …0000000101111101001 |
3 | 201012211002212101002101 |
4 | 2323030212000233221 |
5 | 11243122224342301 |
6 | 232201045133401 |
7 | 20343664261633 |
oct | 2731446005751 |
9 | 635732771071 |
10 | 201001012201 |
11 | 78275916510 |
12 | 32b569ba261 |
13 | 15c53821ca2 |
14 | 9a2b013a53 |
15 | 53662a5701 |
hex | 2ecc980be9 |
201001012201 has 16 divisors (see below), whose sum is σ = 233867010240. Its totient is φ = 170724129280.
The previous prime is 201001012187. The next prime is 201001012249. The reversal of 201001012201 is 102210100102.
201001012201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201001012201 - 29 = 201001011689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201001012291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3897271 + ... + 3948508.
It is an arithmetic number, because the mean of its divisors is an integer number (14616688140).
Almost surely, 2201001012201 is an apocalyptic number.
It is an amenable number.
201001012201 is a deficient number, since it is larger than the sum of its proper divisors (32865998039).
201001012201 is a wasteful number, since it uses less digits than its factorization.
201001012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7845944.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201001012201 its reverse (102210100102), we get a palindrome (303211112303).
It can be divided in two parts, 20100 and 1012201, that added together give a palindrome (1032301).
The spelling of 201001012201 in words is "two hundred one billion, one million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •