Search a number
-
+
101101100111959 is a prime number
BaseRepresentation
bin10110111111001101101111…
…001010001001100001010111
3111020222011121111102202220211
4112333031233022021201113
5101222420023112040314
6555005112035310251
730203212336520263
oct2677155712114127
9436864544382824
10101101100111959
112a239810349602
12b40a0a1a4b387
134454a3cb10b2c
141ad74684470a3
15ba4d11b299c4
hex5bf36f289857

101101100111959 has 2 divisors, whose sum is σ = 101101100111960. Its totient is φ = 101101100111958.

The previous prime is 101101100111927. The next prime is 101101100112007. The reversal of 101101100111959 is 959111001101101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101101100111959 - 25 = 101101100111927 is a prime.

It is a super-2 number, since 2×1011011001119592 (a number of 29 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 101101100111959.

It is a congruent number.

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

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

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

Almost surely, 2101101100111959 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 405, while the sum is 31.

The spelling of 101101100111959 in words is "one hundred one trillion, one hundred one billion, one hundred million, one hundred eleven thousand, nine hundred fifty-nine".