Search a number
-
+
159013195652 = 22159732488781
BaseRepresentation
bin1001010000010111101…
…1001100111110000100
3120012102220101021220202
42110011323030332010
510101124334230102
6201014420350032
714326331601413
oct2240573147604
9505386337822
10159013195652
1161489892483
1226999245318
1311cc199ca1c
1479a683d47a
15420a015e02
hex2505eccf84

159013195652 has 12 divisors (see below), whose sum is σ = 278290625676. Its totient is φ = 79501588320.

The previous prime is 159013195597. The next prime is 159013195667. The reversal of 159013195652 is 256591310951.

It can be written as a sum of positive squares in 2 ways, for example, as 130945554496 + 28067641156 = 361864^2 + 167534^2 .

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

It is a junction number, because it is equal to n+sod(n) for n = 159013195597 and 159013195606.

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, 1180499 + ... + 1308282.

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

Almost surely, 2159013195652 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2504758 (or 2504756 counting only the distinct ones).

The product of its (nonzero) digits is 364500, while the sum is 47.

The spelling of 159013195652 in words is "one hundred fifty-nine billion, thirteen million, one hundred ninety-five thousand, six hundred fifty-two".

Divisors: 1 2 4 15973 31946 63892 2488781 4977562 9955124 39753298913 79506597826 159013195652