Search a number
-
+
159990503911056 = 2433713191399071699
BaseRepresentation
bin100100011000001010110001…
…001001110010111010010000
3202222110221110022010202011000
4210120022301021302322100
5131432241023000123211
61324134342311022000
745461634555642330
oct4430126111627220
9688427408122130
10159990503911056
1146a83656572095
1215b3b29406a900
136b3706952b2a0
142b718202b90c0
151376ac0851656
hex9182b1272e90

159990503911056 has 1280 divisors, whose sum is σ = 600250470400000. Its totient is φ = 39619816851456.

The previous prime is 159990503911013. The next prime is 159990503911093. The reversal of 159990503911056 is 650119305099951.

159990503911056 is a `hidden beast` number, since 1 + 5 + 9 + 9 + 9 + 0 + 503 + 9 + 110 + 5 + 6 = 666.

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

It is a Harshad number since it is a multiple of its sum of digits (63).

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 94167452895 + ... + 94167454593.

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

Almost surely, 2159990503911056 is an apocalyptic number.

159990503911056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 159990503911056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300125235200000).

159990503911056 is an abundant number, since it is smaller than the sum of its proper divisors (440259966488944).

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

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

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

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

The product of its (nonzero) digits is 14762250, while the sum is 63.

The spelling of 159990503911056 in words is "one hundred fifty-nine trillion, nine hundred ninety billion, five hundred three million, nine hundred eleven thousand, fifty-six".