Search a number
-
+
101427912778513 is a prime number
BaseRepresentation
bin10111000011111110000110…
…101101100010001100010001
3111022010102011122010101112011
4113003332012231202030101
5101243243331132403023
6555415201225102521
730235632142405306
oct2703760655421421
9438112148111464
10101427912778513
112a3553775a8062
12b4614aa927a41
1344797c387c4b9
141b091cc5850ad
15bad58d1b750d
hex5c3f86b62311

101427912778513 has 2 divisors, whose sum is σ = 101427912778514. Its totient is φ = 101427912778512.

The previous prime is 101427912778499. The next prime is 101427912778523. The reversal of 101427912778513 is 315877219724101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65929576808209 + 35498335970304 = 8119703^2 + 5958048^2 .

It is a cyclic number.

It is not a de Polignac number, because 101427912778513 - 213 = 101427912770321 is a prime.

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

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

Almost surely, 2101427912778513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5927040, while the sum is 58.

The spelling of 101427912778513 in words is "one hundred one trillion, four hundred twenty-seven billion, nine hundred twelve million, seven hundred seventy-eight thousand, five hundred thirteen".