Search a number
-
+
101246061361 is a prime number
BaseRepresentation
bin101111001001010111…
…1000100101100110001
3100200100000022211002111
41132102233010230301
53124322442430421
6114302314245321
710212654215314
oct1362257045461
9320300284074
10101246061361
1139a35842485
1217757126841
139716a10663
144c8674097b
152978822ee1
hex1792bc4b31

101246061361 has 2 divisors, whose sum is σ = 101246061362. Its totient is φ = 101246061360.

The previous prime is 101246061359. The next prime is 101246061383. The reversal of 101246061361 is 163160642101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100310924961 + 935136400 = 316719^2 + 30580^2 .

It is a cyclic number.

It is not a de Polignac number, because 101246061361 - 21 = 101246061359 is a prime.

It is a super-2 number, since 2×1012460613612 (a number of 23 digits) contains 22 as substring.

Together with 101246061359, it forms a pair of twin primes.

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

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

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

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

Almost surely, 2101246061361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 31.

The spelling of 101246061361 in words is "one hundred one billion, two hundred forty-six million, sixty-one thousand, three hundred sixty-one".