Base | Representation |
---|---|
bin | 1100001111000110000… |
… | …0010001111001110001 |
3 | 202002120220120122110110 |
4 | 3003301200101321301 |
5 | 11421002302414301 |
6 | 240322542051533 |
7 | 21121130141310 |
oct | 3036140217161 |
9 | 662526518413 |
10 | 210210201201 |
11 | 811711a6510 |
12 | 348a6b79ba9 |
13 | 16a90725c50 |
14 | a262120277 |
15 | 5704a040d6 |
hex | 30f1811e71 |
210210201201 has 128 divisors (see below), whose sum is σ = 398849826816. Its totient is φ = 94777159680.
The previous prime is 210210201169. The next prime is 210210201263. The reversal of 210210201201 is 102102012012.
It is not a de Polignac number, because 210210201201 - 25 = 210210201169 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (210210201281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 100722580 + ... + 100724666.
It is an arithmetic number, because the mean of its divisors is an integer number (3116014272).
Almost surely, 2210210201201 is an apocalyptic number.
210210201201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
210210201201 is a deficient number, since it is larger than the sum of its proper divisors (188639625615).
210210201201 is a wasteful number, since it uses less digits than its factorization.
210210201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4111.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210210201201 its reverse (102102012012), we get a palindrome (312312213213).
It can be divided in two parts, 2 and 10210201201, that multiplied together give a palindrome (20420402402).
The spelling of 210210201201 in words is "two hundred ten billion, two hundred ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •