Search a number
-
+
101011201201367 is a prime number
BaseRepresentation
bin10110111101111010000000…
…110001000001010011010111
3111020122120120021202221101122
4112331322000301001103113
5101214431420001420432
6554455523305514155
730163550505424112
oct2675720061012327
9436576507687348
10101011201201367
112a2046787a3486
12b3b4792aa295b
134449413c24192
141ad2d7ab41579
15ba27ee5ba612
hex5bde80c414d7

101011201201367 has 2 divisors, whose sum is σ = 101011201201368. Its totient is φ = 101011201201366.

The previous prime is 101011201201199. The next prime is 101011201201373. The reversal of 101011201201367 is 763102102110101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101011201201367 - 28 = 101011201201111 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101011201201367 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 504, while the sum is 26.

Adding to 101011201201367 its reverse (763102102110101), we get a palindrome (864113303311468).

The spelling of 101011201201367 in words is "one hundred one trillion, eleven billion, two hundred one million, two hundred one thousand, three hundred sixty-seven".