Search a number
-
+
147481110270 = 232513315936857
BaseRepresentation
bin1000100101011010001…
…1110010011011111110
3112002200012201122202100
42021112203302123332
54404020131012040
6151430224005530
713440501516264
oct2112643623376
9462605648670
10147481110270
1157601272aaa
12246bb1608a6
1310ba4768070
1471d1024434
153c828c1b30
hex22568f26fe

147481110270 has 192 divisors, whose sum is σ = 427049086464. Its totient is φ = 35067617280.

The previous prime is 147481110233. The next prime is 147481110299. The reversal of 147481110270 is 72011184741.

147481110270 is a `hidden beast` number, since 1 + 4 + 7 + 481 + 1 + 102 + 70 = 666.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 21504682 + ... + 21511538.

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

Almost surely, 2147481110270 is an apocalyptic number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 12544, while the sum is 36.

The spelling of 147481110270 in words is "one hundred forty-seven billion, four hundred eighty-one million, one hundred ten thousand, two hundred seventy".