Base | Representation |
---|---|
bin | 1011101100111111100… |
… | …0000011110111111101 |
3 | 201012221221110212101222 |
4 | 2323033320003313331 |
5 | 11243230323402021 |
6 | 232210333243125 |
7 | 20345233304426 |
oct | 2731770036775 |
9 | 635857425358 |
10 | 201056075261 |
11 | 782a3a05178 |
12 | 32b713334a5 |
13 | 15c62060a92 |
14 | 9a3446864d |
15 | 536b0306ab |
hex | 2ecfe03dfd |
201056075261 has 2 divisors, whose sum is σ = 201056075262. Its totient is φ = 201056075260.
The previous prime is 201056075183. The next prime is 201056075291. The reversal of 201056075261 is 162570650102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149049272761 + 52006802500 = 386069^2 + 228050^2 .
It is a cyclic number.
It is not a de Polignac number, because 201056075261 - 214 = 201056058877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201056075291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100528037630 + 100528037631.
It is an arithmetic number, because the mean of its divisors is an integer number (100528037631).
Almost surely, 2201056075261 is an apocalyptic number.
It is an amenable number.
201056075261 is a deficient number, since it is larger than the sum of its proper divisors (1).
201056075261 is an equidigital number, since it uses as much as digits as its factorization.
201056075261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 35.
The spelling of 201056075261 in words is "two hundred one billion, fifty-six million, seventy-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •