Search a number
-
+
101461455206113 is a prime number
BaseRepresentation
bin10111000100011101010101…
…111111101111011011100001
3111022020121202021010021000111
4113010131111333233123201
5101244321030013043423
6555442425443451321
730241230305342362
oct2704352577573341
9438217667107014
10101461455206113
112a36861a407402
12b467ab0086b41
13447ca0ab176b2
141b0aa91273b69
15bae3a2cce60d
hex5c4755fef6e1

101461455206113 has 2 divisors, whose sum is σ = 101461455206114. Its totient is φ = 101461455206112.

The previous prime is 101461455206087. The next prime is 101461455206119. The reversal of 101461455206113 is 311602554164101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69768800083984 + 31692655122129 = 8352772^2 + 5629623^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101461455206113 is a prime.

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

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

Almost surely, 2101461455206113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 86400, while the sum is 40.

The spelling of 101461455206113 in words is "one hundred one trillion, four hundred sixty-one billion, four hundred fifty-five million, two hundred six thousand, one hundred thirteen".