Base | Representation |
---|---|
bin | 11101011101011001000… |
… | …11000111001100001001 |
3 | 10120202200210211110210012 |
4 | 32232230203013030021 |
5 | 113041002310401301 |
6 | 2053000500201305 |
7 | 133062363512156 |
oct | 16565443071411 |
9 | 3522623743705 |
10 | 1012212200201 |
11 | 360305442734 |
12 | 14420b999235 |
13 | 745b33997c7 |
14 | 36dc430122d |
15 | 1b4e3950ebb |
hex | ebac8c7309 |
1012212200201 has 2 divisors, whose sum is σ = 1012212200202. Its totient is φ = 1012212200200.
The previous prime is 1012212200191. The next prime is 1012212200203. The reversal of 1012212200201 is 1020022122101.
1012212200201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 778100410000 + 234111790201 = 882100^2 + 483851^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012212200201 - 214 = 1012212183817 is a prime.
Together with 1012212200203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1012212200203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506106100100 + 506106100101.
It is an arithmetic number, because the mean of its divisors is an integer number (506106100101).
Almost surely, 21012212200201 is an apocalyptic number.
It is an amenable number.
1012212200201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012212200201 is an equidigital number, since it uses as much as digits as its factorization.
1012212200201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1012212200201 its reverse (1020022122101), we get a palindrome (2032234322302).
The spelling of 1012212200201 in words is "one trillion, twelve billion, two hundred twelve million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •