Search a number
-
+
104905496953 = 171836105191
BaseRepresentation
bin110000110110011011…
…0101101100101111001
3101000210001012102000001
41201230312231211321
53204321301400303
6120105400513001
710402441003615
oct1415466554571
9330701172001
10104905496953
1140543466614
12183b877b761
139b7ac0086a
145112762345
152adec2531d
hex186cdad979

104905496953 has 4 divisors (see below), whose sum is σ = 104911619328. Its totient is φ = 104899374580.

The previous prime is 104905496933. The next prime is 104905496977. The reversal of 104905496953 is 359694509401.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 104905496953 - 233 = 96315562361 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 104905496894 and 104905496903.

It is not an unprimeable number, because it can be changed into a prime (104905496933) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3035413 + ... + 3069778.

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

Almost surely, 2104905496953 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6122374.

The product of its (nonzero) digits is 5248800, while the sum is 55.

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

Divisors: 1 17183 6105191 104905496953