Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …0011000011001000101 |
3 | 201012211201211010011001 |
4 | 2323031020120121011 |
5 | 11243132031200312 |
6 | 232202010213301 |
7 | 20344133665303 |
oct | 2731510303105 |
9 | 635751733131 |
10 | 201010021957 |
11 | 7827aa0a698 |
12 | 32b59a24231 |
13 | 15c55657bc4 |
14 | 9a2c2bb273 |
15 | 5366e85057 |
hex | 2ecd218645 |
201010021957 has 2 divisors, whose sum is σ = 201010021958. Its totient is φ = 201010021956.
The previous prime is 201010021931. The next prime is 201010021969. The reversal of 201010021957 is 759120010102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125907167556 + 75102854401 = 354834^2 + 274049^2 .
It is a cyclic number.
It is not a de Polignac number, because 201010021957 - 215 = 201009989189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201010021907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505010978 + 100505010979.
It is an arithmetic number, because the mean of its divisors is an integer number (100505010979).
Almost surely, 2201010021957 is an apocalyptic number.
It is an amenable number.
201010021957 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010021957 is an equidigital number, since it uses as much as digits as its factorization.
201010021957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 28.
The spelling of 201010021957 in words is "two hundred one billion, ten million, twenty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •