Search a number
-
+
101111001011023 is a prime number
BaseRepresentation
bin10110111111010110111101…
…010011000101001101001111
3111021000010011111201120010011
4112333112331103011031033
5101223100312224323043
6555013430322054051
730204012602003233
oct2677267523051517
9437003144646104
10101111001011023
112a242a31126613
12b40bba57aa327
13445595a110aa3
141ad7b273705c3
15ba51e0e5e59d
hex5bf5bd4c534f

101111001011023 has 2 divisors, whose sum is σ = 101111001011024. Its totient is φ = 101111001011022.

The previous prime is 101111001010949. The next prime is 101111001011029. The reversal of 101111001011023 is 320110100111101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101111001011023 - 29 = 101111001010511 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 101111001010994 and 101111001011012.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101111001011029) 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, 50555500505511 + 50555500505512.

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

Almost surely, 2101111001011023 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 101111001011023 its reverse (320110100111101), we get a palindrome (421221101122124).

The spelling of 101111001011023 in words is "one hundred one trillion, one hundred eleven billion, one million, eleven thousand, twenty-three".