Search a number
-
+
101011110110321 is a prime number
BaseRepresentation
bin10110111101111001111011…
…010101100010010001110001
3111020122120022221101000222012
4112331321323111202101301
5101214431223142012241
6554455510253252305
730163545321235415
oct2675717325422161
9436576287330865
10101011110110321
112a204631337424
12b3b4768494095
1344493cb0ac758
141ad2d6c9ccd45
15ba27e65c56eb
hex5bde7b562471

101011110110321 has 2 divisors, whose sum is σ = 101011110110322. Its totient is φ = 101011110110320.

The previous prime is 101011110110311. The next prime is 101011110110353. The reversal of 101011110110321 is 123011011110101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93967606428721 + 7043503681600 = 9693689^2 + 2653960^2 .

It is a cyclic number.

It is not a de Polignac number, because 101011110110321 - 210 = 101011110109297 is a prime.

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

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

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

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

Almost surely, 2101011110110321 is an apocalyptic number.

It is an amenable number.

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

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

101011110110321 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 14.

Adding to 101011110110321 its reverse (123011011110101), we get a palindrome (224022121220422).

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