Search a number
-
+
104522525201413 = 119502047745583
BaseRepresentation
bin10111110001000000001011…
…111111000101010000000101
3111201002020220111100201211101
4113301000023333011100011
5102144444112422421123
61010144552445140101
731005334420112134
oct2761001377052005
9451066814321741
10104522525201413
1130338832641480
12b8811ba25a631
13464257c97b297
141bb4cbab8b91b
15c13d0db81aad
hex5f100bfc5405

104522525201413 has 4 divisors (see below), whose sum is σ = 114024572947008. Its totient is φ = 95020477455820.

The previous prime is 104522525201389. The next prime is 104522525201417. The reversal of 104522525201413 is 314102525225401.

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 104522525201413 - 233 = 104513935266821 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (104522525201417) 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, 4751023872781 + ... + 4751023872802.

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

Almost surely, 2104522525201413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 9502047745594.

The product of its (nonzero) digits is 96000, while the sum is 37.

The spelling of 104522525201413 in words is "one hundred four trillion, five hundred twenty-two billion, five hundred twenty-five million, two hundred one thousand, four hundred thirteen".

Divisors: 1 11 9502047745583 104522525201413