Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …1011001111100100001 |
3 | 201020100001102110212202 |
4 | 2323120201121330201 |
5 | 11244024442200142 |
6 | 232232554302545 |
7 | 20351644253345 |
oct | 2733041317441 |
9 | 636301373782 |
10 | 201201131297 |
11 | 7836887a9a1 |
12 | 32bb1a27a55 |
13 | 15c8611b55a |
14 | 9a49827625 |
15 | 5378b35032 |
hex | 2ed8859f21 |
201201131297 has 2 divisors, whose sum is σ = 201201131298. Its totient is φ = 201201131296.
The previous prime is 201201131269. The next prime is 201201131303. The reversal of 201201131297 is 792131102102.
201201131297 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., 195725723281 + 5475408016 = 442409^2 + 73996^2 .
It is a cyclic number.
It is not a de Polignac number, because 201201131297 - 212 = 201201127201 is a prime.
It is not a weakly prime, because it can be changed into another prime (201201131497) 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, 100600565648 + 100600565649.
It is an arithmetic number, because the mean of its divisors is an integer number (100600565649).
Almost surely, 2201201131297 is an apocalyptic number.
It is an amenable number.
201201131297 is a deficient number, since it is larger than the sum of its proper divisors (1).
201201131297 is an equidigital number, since it uses as much as digits as its factorization.
201201131297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
Adding to 201201131297 its reverse (792131102102), we get a palindrome (993332233399).
The spelling of 201201131297 in words is "two hundred one billion, two hundred one million, one hundred thirty-one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •