Search a number
-
+
101101044902257 is a prime number
BaseRepresentation
bin10110111111001101101011…
…110111100010100101110001
3111020222011110122112211110001
4112333031223313202211301
5101222414414443333012
6555005102344110001
730203211066324121
oct2677155367424561
9436864418484401
10101101044902257
112a23979216a754
12b40a087465301
134454a3155037a
141ad7460d94c81
15ba4d0bd71357
hex5bf36bde2971

101101044902257 has 2 divisors, whose sum is σ = 101101044902258. Its totient is φ = 101101044902256.

The previous prime is 101101044902183. The next prime is 101101044902287. The reversal of 101101044902257 is 752209440101101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 80672443822656 + 20428601079601 = 8981784^2 + 4519801^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101044902257 - 243 = 92304951880049 is a prime.

It is a super-2 number, since 2×1011010449022572 (a number of 29 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (101101044902287) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550522451128 + 50550522451129.

It is an arithmetic number, because the mean of its divisors is an integer number (50550522451129).

Almost surely, 2101101044902257 is an apocalyptic number.

It is an amenable number.

101101044902257 is a deficient number, since it is larger than the sum of its proper divisors (1).

101101044902257 is an equidigital number, since it uses as much as digits as its factorization.

101101044902257 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 20160, while the sum is 37.

The spelling of 101101044902257 in words is "one hundred one trillion, one hundred one billion, forty-four million, nine hundred two thousand, two hundred fifty-seven".