Search a number
-
+
104857583151 = 364354358519
BaseRepresentation
bin110000110100111111…
…1111011111000101111
3101000122201001010121210
41201221333323320233
53204222020130101
6120100525525503
710401316515336
oct1415177737057
9330581033553
10104857583151
1140519410232
12183a4713893
139b70cc5bb9
14510a24cd1d
152ada90d7d6
hex1869ffbe2f

104857583151 has 8 divisors (see below), whose sum is σ = 140027547520. Its totient is φ = 69796337112.

The previous prime is 104857583143. The next prime is 104857583167. The reversal of 104857583151 is 151385758401.

It is a happy number.

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

It is not a de Polignac number, because 104857583151 - 23 = 104857583143 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 2104857583151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 54359165.

The product of its (nonzero) digits is 672000, while the sum is 48.

The spelling of 104857583151 in words is "one hundred four billion, eight hundred fifty-seven million, five hundred eighty-three thousand, one hundred fifty-one".

Divisors: 1 3 643 1929 54358519 163075557 34952527717 104857583151