Base | Representation |
---|---|
bin | 1011000001100110010110… |
… | …0101101111000011101001 |
3 | 1120220212021010201110122220 |
4 | 2300121211211233003221 |
5 | 3042102031114201301 |
6 | 41440452233504253 |
7 | 2360535663516642 |
oct | 260314545570351 |
9 | 46825233643586 |
10 | 12122102100201 |
11 | 3953a55681a15 |
12 | 1439417572089 |
13 | 69c15624ba12 |
14 | 2dc9da19a6c9 |
15 | 1604cc705936 |
hex | b066596f0e9 |
12122102100201 has 8 divisors (see below), whose sum is σ = 16233382726080. Its totient is φ = 8046111437232.
The previous prime is 12122102100197. The next prime is 12122102100209. The reversal of 12122102100201 is 10200120122121.
12122102100201 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 12122102100201 - 22 = 12122102100197 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12122102100209) 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, 8822489925 + ... + 8822491298.
It is an arithmetic number, because the mean of its divisors is an integer number (2029172840760).
Almost surely, 212122102100201 is an apocalyptic number.
It is an amenable number.
12122102100201 is a deficient number, since it is larger than the sum of its proper divisors (4111280625879).
12122102100201 is a wasteful number, since it uses less digits than its factorization.
12122102100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17644981455.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12122102100201 its reverse (10200120122121), we get a palindrome (22322222222322).
The spelling of 12122102100201 in words is "twelve trillion, one hundred twenty-two billion, one hundred two million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •