Base | Representation |
---|---|
bin | 101101110010011011101000… |
… | …001010110000011110101101 |
3 | 222102000112010101000210012021 |
4 | 231302123220022300132231 |
5 | 202343333043313240011 |
6 | 1552143353002510141 |
7 | 60263026631215141 |
oct | 5562335012603655 |
9 | 872015111023167 |
10 | 201377731774381 |
11 | 5918a8a8753098 |
12 | 1a70442ab05351 |
13 | 8849ab95bc796 |
14 | 37a2a3c9cb221 |
15 | 184346c28b471 |
hex | b726e82b07ad |
201377731774381 has 2 divisors, whose sum is σ = 201377731774382. Its totient is φ = 201377731774380.
The previous prime is 201377731774367. The next prime is 201377731774441. The reversal of 201377731774381 is 183477137773102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198808138804356 + 2569592970025 = 14099934^2 + 1602995^2 .
It is a cyclic number.
It is not a de Polignac number, because 201377731774381 - 237 = 201240292820909 is a prime.
It is a super-2 number, since 2×2013777317743812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201377731774481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100688865887190 + 100688865887191.
It is an arithmetic number, because the mean of its divisors is an integer number (100688865887191).
Almost surely, 2201377731774381 is an apocalyptic number.
It is an amenable number.
201377731774381 is a deficient number, since it is larger than the sum of its proper divisors (1).
201377731774381 is an equidigital number, since it uses as much as digits as its factorization.
201377731774381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29042496, while the sum is 61.
The spelling of 201377731774381 in words is "two hundred one trillion, three hundred seventy-seven billion, seven hundred thirty-one million, seven hundred seventy-four thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •