Base | Representation |
---|---|
bin | 10001011110101000010… |
… | …101100011111101111101 |
3 | 11020211022010101002121211 |
4 | 101132220111203331331 |
5 | 124134343221201341 |
6 | 2315441552124421 |
7 | 152530606253236 |
oct | 21365025437575 |
9 | 4224263332554 |
10 | 1201120100221 |
11 | 423434a8aa58 |
12 | 174950836711 |
13 | 8935a6855c2 |
14 | 421c51ba08d |
15 | 2139d1e2181 |
hex | 117a8563f7d |
1201120100221 has 4 divisors (see below), whose sum is σ = 1201157973244. Its totient is φ = 1201082227200.
The previous prime is 1201120100183. The next prime is 1201120100251. The reversal of 1201120100221 is 1220010211021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 443541348121 + 757578752100 = 665989^2 + 870390^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201120100221 - 27 = 1201120100093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201120100251) 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, 18888900 + ... + 18952381.
It is an arithmetic number, because the mean of its divisors is an integer number (300289493311).
Almost surely, 21201120100221 is an apocalyptic number.
It is an amenable number.
1201120100221 is a deficient number, since it is larger than the sum of its proper divisors (37873023).
1201120100221 is an equidigital number, since it uses as much as digits as its factorization.
1201120100221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37873022.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1201120100221 its reverse (1220010211021), we get a palindrome (2421130311242).
The spelling of 1201120100221 in words is "one trillion, two hundred one billion, one hundred twenty million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •