Base | Representation |
---|---|
bin | 10001011110100001110… |
… | …010011001110001000101 |
3 | 11020211000110121121102202 |
4 | 101132201302121301011 |
5 | 124134132104020401 |
6 | 2315423025044245 |
7 | 152525103301106 |
oct | 21364162316105 |
9 | 4224013547382 |
10 | 1201010220101 |
11 | 423388a6043a |
12 | 17491ba86685 |
13 | 89340992993 |
14 | 421b47763ad |
15 | 2139373a06b |
hex | 117a1c99c45 |
1201010220101 has 2 divisors, whose sum is σ = 1201010220102. Its totient is φ = 1201010220100.
The previous prime is 1201010220083. The next prime is 1201010220103. The reversal of 1201010220101 is 1010220101021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 889645104100 + 311365116001 = 943210^2 + 558001^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201010220101 - 26 = 1201010220037 is a prime.
Together with 1201010220103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201010220103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600505110050 + 600505110051.
It is an arithmetic number, because the mean of its divisors is an integer number (600505110051).
Almost surely, 21201010220101 is an apocalyptic number.
It is an amenable number.
1201010220101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201010220101 is an equidigital number, since it uses as much as digits as its factorization.
1201010220101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1201010220101 its reverse (1010220101021), we get a palindrome (2211230321122).
The spelling of 1201010220101 in words is "one trillion, two hundred one billion, ten million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •