Base | Representation |
---|---|
bin | 1011101100111100001… |
… | …0111000010011110101 |
3 | 201012220222020120221122 |
4 | 2323033002320103311 |
5 | 11243213241244021 |
6 | 232205114353325 |
7 | 20345003642213 |
oct | 2731702702365 |
9 | 635828216848 |
10 | 201042134261 |
11 | 78297053091 |
12 | 32b6872b845 |
13 | 15c5c1bc477 |
14 | 9a32679cb3 |
15 | 5369bc9bab |
hex | 2ecf0b84f5 |
201042134261 has 2 divisors, whose sum is σ = 201042134262. Its totient is φ = 201042134260.
The previous prime is 201042134239. The next prime is 201042134269. The reversal of 201042134261 is 162431240102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139237191025 + 61804943236 = 373145^2 + 248606^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201042134261 is a prime.
It is a super-2 number, since 2×2010421342612 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201042134261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201042134269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100521067130 + 100521067131.
It is an arithmetic number, because the mean of its divisors is an integer number (100521067131).
Almost surely, 2201042134261 is an apocalyptic number.
It is an amenable number.
201042134261 is a deficient number, since it is larger than the sum of its proper divisors (1).
201042134261 is an equidigital number, since it uses as much as digits as its factorization.
201042134261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 201042134261 its reverse (162431240102), we get a palindrome (363473374363).
The spelling of 201042134261 in words is "two hundred one billion, forty-two million, one hundred thirty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •