Search a number
-
+
101111009485723 is a prime number
BaseRepresentation
bin10110111111010110111101…
…110011011010001110011011
3111021000010012002200010012221
4112333112331303122032123
5101223100321412020343
6555013431223444511
730204013034020636
oct2677267563321633
9437003162603187
10101111009485723
112a242a359947a6
12b40bba85b6737
13445595baba2c3
141ad7b28538c1d
15ba51e1a855ed
hex5bf5bdcda39b

101111009485723 has 2 divisors, whose sum is σ = 101111009485724. Its totient is φ = 101111009485722.

The previous prime is 101111009485709. The next prime is 101111009485757. The reversal of 101111009485723 is 327584900111101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101111009485723 - 213 = 101111009477531 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101111009485723.

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

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

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

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

Almost surely, 2101111009485723 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 60480, while the sum is 43.

Adding to 101111009485723 its reverse (327584900111101), we get a palindrome (428695909596824).

The spelling of 101111009485723 in words is "one hundred one trillion, one hundred eleven billion, nine million, four hundred eighty-five thousand, seven hundred twenty-three".