Search a number
-
+
104957469131 is a prime number
BaseRepresentation
bin110000110111111110…
…0111110000111001011
3101000220122222212102112
41201233330332013023
53204423103003011
6120114454452535
710403641524164
oct1415774760713
9330818885375
10104957469131
114056a834029
121841206414b
139b888c9828
14511961076b
152ae458e58b
hex186ff3e1cb

104957469131 has 2 divisors, whose sum is σ = 104957469132. Its totient is φ = 104957469130.

The previous prime is 104957469053. The next prime is 104957469139. The reversal of 104957469131 is 131964759401.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 104957469131 - 218 = 104957206987 is a prime.

It is a super-2 number, since 2×1049574691312 (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 104957469131.

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

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

Almost surely, 2104957469131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 816480, while the sum is 50.

The spelling of 104957469131 in words is "one hundred four billion, nine hundred fifty-seven million, four hundred sixty-nine thousand, one hundred thirty-one".