Search a number
-
+
101101001010169 is a prime number
BaseRepresentation
bin10110111111001101101001…
…010000000110101111111001
3111020222011100120221212211011
4112333031221100012233321
5101222414322224311134
6555005054135233521
730203210024255626
oct2677155120065771
9436864316855734
10101101001010169
112a23976a4109a6
12b40a0748188a1
134454a25423114
141ad745920b34d
15ba4d080a1264
hex5bf369406bf9

101101001010169 has 2 divisors, whose sum is σ = 101101001010170. Its totient is φ = 101101001010168.

The previous prime is 101101001010167. The next prime is 101101001010181. The reversal of 101101001010169 is 961010100101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100164967980025 + 936033030144 = 10008245^2 + 967488^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101001010169 - 21 = 101101001010167 is a prime.

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

Together with 101101001010167, it forms a pair of twin primes.

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

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

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

Almost surely, 2101101001010169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 22.

The spelling of 101101001010169 in words is "one hundred one trillion, one hundred one billion, one million, ten thousand, one hundred sixty-nine".