Base | Representation |
---|---|
bin | 1011101101101001101… |
… | …1010111010011011001 |
3 | 201020102021120202111101 |
4 | 2323122123113103121 |
5 | 11244111133231131 |
6 | 232240055431401 |
7 | 20352513100456 |
oct | 2733233272331 |
9 | 636367522441 |
10 | 201233102041 |
11 | 78384926aa4 |
12 | 33000685561 |
13 | 15c8c93355a |
14 | 9a4db8a82d |
15 | 537b84cc61 |
hex | 2eda6d74d9 |
201233102041 has 2 divisors, whose sum is σ = 201233102042. Its totient is φ = 201233102040.
The previous prime is 201233102027. The next prime is 201233102129. The reversal of 201233102041 is 140201332102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126573004441 + 74660097600 = 355771^2 + 273240^2 .
It is a cyclic number.
It is not a de Polignac number, because 201233102041 - 227 = 201098884313 is a prime.
It is a super-2 number, since 2×2012331020412 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201233132041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100616551020 + 100616551021.
It is an arithmetic number, because the mean of its divisors is an integer number (100616551021).
Almost surely, 2201233102041 is an apocalyptic number.
It is an amenable number.
201233102041 is a deficient number, since it is larger than the sum of its proper divisors (1).
201233102041 is an equidigital number, since it uses as much as digits as its factorization.
201233102041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 201233102041 its reverse (140201332102), we get a palindrome (341434434143).
The spelling of 201233102041 in words is "two hundred one billion, two hundred thirty-three million, one hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •