Base | Representation |
---|---|
bin | 10001011110100111001… |
… | …100101111010100011001 |
3 | 11020211020210110020001001 |
4 | 101132213030233110121 |
5 | 124134323324311301 |
6 | 2315440031025001 |
7 | 152530255064221 |
oct | 21364714572431 |
9 | 4224223406031 |
10 | 1201101010201 |
11 | 423425231384 |
12 | 17494636b161 |
13 | 89356730431 |
14 | 421c284b081 |
15 | 2139b6c0c01 |
hex | 117a732f519 |
1201101010201 has 2 divisors, whose sum is σ = 1201101010202. Its totient is φ = 1201101010200.
The previous prime is 1201101010157. The next prime is 1201101010237. The reversal of 1201101010201 is 1020101011021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 663776825625 + 537324184576 = 814725^2 + 733024^2 .
It is an emirp because it is prime and its reverse (1020101011021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1201101010201 - 223 = 1201092621593 is a prime.
It is not a weakly prime, because it can be changed into another prime (1201101010301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600550505100 + 600550505101.
It is an arithmetic number, because the mean of its divisors is an integer number (600550505101).
Almost surely, 21201101010201 is an apocalyptic number.
It is an amenable number.
1201101010201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201101010201 is an equidigital number, since it uses as much as digits as its factorization.
1201101010201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1201101010201 its reverse (1020101011021), we get a palindrome (2221202021222).
It can be divided in two parts, 120110 and 1010201, that added together give a palindrome (1130311).
The spelling of 1201101010201 in words is "one trillion, two hundred one billion, one hundred one million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •