Base | Representation |
---|---|
bin | 1100001110101011110… |
… | …0101010001100001001 |
3 | 202002022020121000110100 |
4 | 3003222330222030021 |
5 | 11420241122401301 |
6 | 240304012240013 |
7 | 21115323143553 |
oct | 3035274521411 |
9 | 662266530410 |
10 | 210100200201 |
11 | 811150a40a1 |
12 | 34876170009 |
13 | 16a739c02b8 |
14 | a2516884d3 |
15 | 56ea026286 |
hex | 30eaf2a309 |
210100200201 has 6 divisors (see below), whose sum is σ = 303478066970. Its totient is φ = 140066800128.
The previous prime is 210100200173. The next prime is 210100200221. The reversal of 210100200201 is 102002001012.
It can be written as a sum of positive squares in only one way, i.e., 172308840201 + 37791360000 = 415101^2 + 194400^2 .
It is not a de Polignac number, because 210100200201 - 26 = 210100200137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 23344466689 = 210100200201 / (2 + 1 + 0 + 1 + 0 + 0 + 2 + 0 + 0 + 2 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210100200221) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11672233336 + ... + 11672233353.
Almost surely, 2210100200201 is an apocalyptic number.
It is an amenable number.
210100200201 is a deficient number, since it is larger than the sum of its proper divisors (93377866769).
210100200201 is a wasteful number, since it uses less digits than its factorization.
210100200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23344466695 (or 23344466692 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 210100200201 its reverse (102002001012), we get a palindrome (312102201213).
The spelling of 210100200201 in words is "two hundred ten billion, one hundred million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •