Base | Representation |
---|---|
bin | 1011101101101010010… |
… | …0010100100100001001 |
3 | 201020102110000001110022 |
4 | 2323122210110210021 |
5 | 11244112233400441 |
6 | 232240222030225 |
7 | 20352542050256 |
oct | 2733244244411 |
9 | 636373001408 |
10 | 201235450121 |
11 | 78386190162 |
12 | 33001418375 |
13 | 15c90276254 |
14 | 9a501dc42d |
15 | 537bb6384b |
hex | 2eda914909 |
201235450121 has 2 divisors, whose sum is σ = 201235450122. Its totient is φ = 201235450120.
The previous prime is 201235450049. The next prime is 201235450147. The reversal of 201235450121 is 121054532102.
It is an a-pointer prime, because the next prime (201235450147) can be obtained adding 201235450121 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139828132096 + 61407318025 = 373936^2 + 247805^2 .
It is a cyclic number.
It is not a de Polignac number, because 201235450121 - 210 = 201235449097 is a prime.
It is not a weakly prime, because it can be changed into another prime (201235450321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100617725060 + 100617725061.
It is an arithmetic number, because the mean of its divisors is an integer number (100617725061).
Almost surely, 2201235450121 is an apocalyptic number.
It is an amenable number.
201235450121 is a deficient number, since it is larger than the sum of its proper divisors (1).
201235450121 is an equidigital number, since it uses as much as digits as its factorization.
201235450121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 201235450121 its reverse (121054532102), we get a palindrome (322289982223).
The spelling of 201235450121 in words is "two hundred one billion, two hundred thirty-five million, four hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •