Search a number
-
+
104051131465 = 543483958751
BaseRepresentation
bin110000011100111101…
…1100100010001001001
3100221120111120010212211
41200321323210101021
53201044042201330
6115444520505121
710342325011261
oct1407173442111
9327514503784
10104051131465
1140145173136
12181ba61b1a1
139a72bc4558
1450710c47a1
152a8ec0ed2a
hex1839ee4449

104051131465 has 8 divisors (see below), whose sum is σ = 127765110528. Its totient is φ = 81305070000.

The previous prime is 104051131463. The next prime is 104051131519. The reversal of 104051131465 is 564131150401.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 104051131465 - 21 = 104051131463 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241979161 + ... + 241979590.

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

Almost surely, 2104051131465 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 483958799.

The product of its (nonzero) digits is 7200, while the sum is 31.

Adding to 104051131465 its reverse (564131150401), we get a palindrome (668182281866).

The spelling of 104051131465 in words is "one hundred four billion, fifty-one million, one hundred thirty-one thousand, four hundred sixty-five".

Divisors: 1 5 43 215 483958751 2419793755 20810226293 104051131465