Base | Representation |
---|---|
bin | 101111110001011000110110… |
… | …001110101010111010110001 |
3 | 1000112220120021222122212120111 |
4 | 233301120312032222322301 |
5 | 210014303120210014301 |
6 | 2022503325332341321 |
7 | 62153243252450131 |
oct | 5761306616527261 |
9 | 1015816258585514 |
10 | 210102120001201 |
11 | 60a4389943177a |
12 | 1b693246a74841 |
13 | 90307111c87cc |
14 | 39c4dd5588ac1 |
15 | 19453893d5551 |
hex | bf16363aaeb1 |
210102120001201 has 4 divisors (see below), whose sum is σ = 210168044736112. Its totient is φ = 210036195266292.
The previous prime is 210102120001063. The next prime is 210102120001247. The reversal of 210102120001201 is 102100021201012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 210102120001201 - 217 = 210102119870129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210102120005201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32962362675 + ... + 32962369048.
It is an arithmetic number, because the mean of its divisors is an integer number (52542011184028).
Almost surely, 2210102120001201 is an apocalyptic number.
It is an amenable number.
210102120001201 is a deficient number, since it is larger than the sum of its proper divisors (65924734911).
210102120001201 is an equidigital number, since it uses as much as digits as its factorization.
210102120001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65924734910.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210102120001201 its reverse (102100021201012), we get a palindrome (312202141202213).
The spelling of 210102120001201 in words is "two hundred ten trillion, one hundred two billion, one hundred twenty million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •