Search a number
-
+
105057533531 is a prime number
BaseRepresentation
bin110000111010111101…
…0101011111001011011
3101001011122021122222102
41201311322223321123
53210124212033111
6120132431314015
710406265205136
oct1416572537133
9331148248872
10105057533531
1140611269985
121843b67b90b
139ba3563732
145128a1b21d
152aed25813b
hex1875eabe5b

105057533531 has 2 divisors, whose sum is σ = 105057533532. Its totient is φ = 105057533530.

The previous prime is 105057533513. The next prime is 105057533533. The reversal of 105057533531 is 135335750501.

Together with previous prime (105057533513) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 105057533531 - 226 = 104990424667 is a prime.

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

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

It is a Chen prime.

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

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

Almost surely, 2105057533531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 118125, while the sum is 38.

The spelling of 105057533531 in words is "one hundred five billion, fifty-seven million, five hundred thirty-three thousand, five hundred thirty-one".