Base | Representation |
---|---|
bin | 1011101100111111011… |
… | …1111111110111111101 |
3 | 201012221221110000221011 |
4 | 2323033313333313331 |
5 | 11243230322341002 |
6 | 232210333035221 |
7 | 20345233205602 |
oct | 2731767776775 |
9 | 635857400834 |
10 | 201056058877 |
11 | 782a39a3933 |
12 | 32b71325b11 |
13 | 15c6205649b |
14 | 9a344626a9 |
15 | 536b02a8d7 |
hex | 2ecfdffdfd |
201056058877 has 2 divisors, whose sum is σ = 201056058878. Its totient is φ = 201056058876.
The previous prime is 201056058859. The next prime is 201056058901. The reversal of 201056058877 is 778850650102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 201052695321 + 3363556 = 448389^2 + 1834^2 .
It is a cyclic number.
It is not a de Polignac number, because 201056058877 - 227 = 200921841149 is a prime.
It is a super-2 number, since 2×2010560588772 (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 201056058877.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201056058977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100528029438 + 100528029439.
It is an arithmetic number, because the mean of its divisors is an integer number (100528029439).
Almost surely, 2201056058877 is an apocalyptic number.
It is an amenable number.
201056058877 is a deficient number, since it is larger than the sum of its proper divisors (1).
201056058877 is an equidigital number, since it uses as much as digits as its factorization.
201056058877 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 940800, while the sum is 49.
The spelling of 201056058877 in words is "two hundred one billion, fifty-six million, fifty-eight thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •