Search a number
-
+
101010119569 is a prime number
BaseRepresentation
bin101111000010010101…
…1000001101110010001
3100122201120100201210121
41132010223001232101
53123332042311234
6114223045230241
710204060564342
oct1360453015621
9318646321717
10101010119569
1139924640967
12176b0102381
1396a9b80a28
144c632840c9
152962c694b4
hex1784ac1b91

101010119569 has 2 divisors, whose sum is σ = 101010119570. Its totient is φ = 101010119568.

The previous prime is 101010119537. The next prime is 101010119593. The reversal of 101010119569 is 965911010101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 95364851344 + 5645268225 = 308812^2 + 75135^2 .

It is an emirp because it is prime and its reverse (965911010101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 101010119569 - 25 = 101010119537 is a prime.

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

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

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

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

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

Almost surely, 2101010119569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2430, while the sum is 34.

The spelling of 101010119569 in words is "one hundred one billion, ten million, one hundred nineteen thousand, five hundred sixty-nine".