Base | Representation |
---|---|
bin | 1011101100111011111… |
… | …1010100100011100101 |
3 | 201012220220111012021112 |
4 | 2323032333110203211 |
5 | 11243213021421011 |
6 | 232205042354405 |
7 | 20344663005356 |
oct | 2731677244345 |
9 | 635826435245 |
10 | 201041201381 |
11 | 78296576209 |
12 | 32b6835ba05 |
13 | 15c5bc53977 |
14 | 9a324b5d2d |
15 | 5369a9358b |
hex | 2ecefd48e5 |
201041201381 has 2 divisors, whose sum is σ = 201041201382. Its totient is φ = 201041201380.
The previous prime is 201041201353. The next prime is 201041201441. The reversal of 201041201381 is 183102140102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 189686380900 + 11354820481 = 435530^2 + 106559^2 .
It is a cyclic number.
It is not a de Polignac number, because 201041201381 - 222 = 201037007077 is a prime.
It is a super-2 number, since 2×2010412013812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201041201311) 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, 100520600690 + 100520600691.
It is an arithmetic number, because the mean of its divisors is an integer number (100520600691).
Almost surely, 2201041201381 is an apocalyptic number.
It is an amenable number.
201041201381 is a deficient number, since it is larger than the sum of its proper divisors (1).
201041201381 is an equidigital number, since it uses as much as digits as its factorization.
201041201381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 201041201381 its reverse (183102140102), we get a palindrome (384143341483).
The spelling of 201041201381 in words is "two hundred one billion, forty-one million, two hundred one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •