Search a number
-
+
161513550642 = 2326918925107
BaseRepresentation
bin1001011001101011110…
…1010011001100110010
3120102220011020111011010
42112122331103030302
510121234432110032
6202110455531350
714445312346203
oct2263275231462
9512804214133
10161513550642
1162552209164
1227376689b56
13122cc9c4912
147b629435aa
1543047b1ccc
hex259af53332

161513550642 has 8 divisors (see below), whose sum is σ = 323027101296. Its totient is φ = 53837850212.

The previous prime is 161513550623. The next prime is 161513550691. The reversal of 161513550642 is 246055315161.

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

161513550642 is an admirable number.

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

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

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, 13459462548 + ... + 13459462559.

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

Almost surely, 2161513550642 is an apocalyptic number.

161513550642 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.

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

161513550642 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 26918925112.

The product of its (nonzero) digits is 108000, while the sum is 39.

The spelling of 161513550642 in words is "one hundred sixty-one billion, five hundred thirteen million, five hundred fifty thousand, six hundred forty-two".

Divisors: 1 2 3 6 26918925107 53837850214 80756775321 161513550642