Search a number
-
+
104857815162 = 2317476302527
BaseRepresentation
bin110000110101000000…
…0110100100001111010
3101000122201110220212210
41201222000310201322
53204222100041122
6120100534515550
710401321502632
oct1415200644172
9330581426783
10104857815162
1140519559581
12183a4805bb6
139b71077699
14510a2ad6c2
152ada95740c
hex186a03487a

104857815162 has 8 divisors (see below), whose sum is σ = 209715630336. Its totient is φ = 34952605052.

The previous prime is 104857815157. The next prime is 104857815217. The reversal of 104857815162 is 261518758401.

104857815162 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

104857815162 is an admirable number.

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

It is an unprimeable number.

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

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

Almost surely, 2104857815162 is an apocalyptic number.

104857815162 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

104857815162 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 17476302532.

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

The spelling of 104857815162 in words is "one hundred four billion, eight hundred fifty-seven million, eight hundred fifteen thousand, one hundred sixty-two".

Divisors: 1 2 3 6 17476302527 34952605054 52428907581 104857815162