Search a number
-
+
105494959051 is a prime number
BaseRepresentation
bin110001000111111111…
…1010101001111001011
3101002022010101011222121
41202033333111033023
53212023202142201
6120244055032111
710423156233166
oct1421777251713
9332263334877
10105494959051
1140816177179
121854206b637
139c43079ac1
14516ab64add
152b268609a1
hex188ffd53cb

105494959051 has 2 divisors, whose sum is σ = 105494959052. Its totient is φ = 105494959050.

The previous prime is 105494959019. The next prime is 105494959109. The reversal of 105494959051 is 150959494501.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 105494959051 - 25 = 105494959019 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 105494959051.

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

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

Almost surely, 2105494959051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458000, while the sum is 52.

The spelling of 105494959051 in words is "one hundred five billion, four hundred ninety-four million, nine hundred fifty-nine thousand, fifty-one".