Base | Representation |
---|---|
bin | 1001010010011011000100… |
… | …1100011110011011101001 |
3 | 1100011021020111210202202110 |
4 | 2110212301030132123221 |
5 | 2314303400141201301 |
6 | 33415213440352533 |
7 | 2102541415425012 |
oct | 224466114363351 |
9 | 40137214722673 |
10 | 10212110100201 |
11 | 3287a27a16799 |
12 | 118b213015749 |
13 | 590cc837b059 |
14 | 2743a96cc009 |
15 | 12a9916350d6 |
hex | 949b131e6e9 |
10212110100201 has 8 divisors (see below), whose sum is σ = 13616877472384. Its totient is φ = 6807708064080.
The previous prime is 10212110100173. The next prime is 10212110100253. The reversal of 10212110100201 is 10200101121201.
10212110100201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10212110100201 - 25 = 10212110100169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10212110100281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91268785 + ... + 91380606.
It is an arithmetic number, because the mean of its divisors is an integer number (1702109684048).
Almost surely, 210212110100201 is an apocalyptic number.
It is an amenable number.
10212110100201 is a deficient number, since it is larger than the sum of its proper divisors (3404767372183).
10212110100201 is a wasteful number, since it uses less digits than its factorization.
10212110100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182668031.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10212110100201 its reverse (10200101121201), we get a palindrome (20412211221402).
The spelling of 10212110100201 in words is "ten trillion, two hundred twelve billion, one hundred ten million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •