Base | Representation |
---|---|
bin | 101111110001011000110101… |
… | …001010000011000100101001 |
3 | 1000112220120020201210221022020 |
4 | 233301120311022003010221 |
5 | 210014303101103342301 |
6 | 2022503323451015053 |
7 | 62153242643525100 |
oct | 5761306512030451 |
9 | 1015816221727266 |
10 | 210102102012201 |
11 | 60a4388a265333 |
12 | 1b693240a3a489 |
13 | 903070a56a829 |
14 | 39c4dd3025037 |
15 | 1945387a30436 |
hex | bf1635283129 |
210102102012201 has 24 divisors (see below), whose sum is σ = 328918186810080. Its totient is φ = 118936303399872.
The previous prime is 210102102012157. The next prime is 210102102012221. The reversal of 210102102012201 is 102210201201012.
It is not a de Polignac number, because 210102102012201 - 210 = 210102102011177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210102102012221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6678797356 + ... + 6678828813.
It is an arithmetic number, because the mean of its divisors is an integer number (13704924450420).
Almost surely, 2210102102012201 is an apocalyptic number.
210102102012201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
210102102012201 is a deficient number, since it is larger than the sum of its proper divisors (118816084797879).
210102102012201 is a wasteful number, since it uses less digits than its factorization.
210102102012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13357626293 (or 13357626286 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210102102012201 its reverse (102210201201012), we get a palindrome (312312303213213).
The spelling of 210102102012201 in words is "two hundred ten trillion, one hundred two billion, one hundred two million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •