Search a number
-
+
143100216270 = 233511193796691
BaseRepresentation
bin1000010101000101110…
…0000000001111001110
3111200100220022011222000
42011101130000033032
54321032123410040
6145423410133130
713224104524464
oct2052134001716
9450326264860
10143100216270
1155763383550
1223897b811a6
1310656c645ab
146cd7280834
153ac7eae130
hex21517003ce

143100216270 has 256 divisors, whose sum is σ = 439423488000. Its totient is φ = 32773507200.

The previous prime is 143100216263. The next prime is 143100216373. The reversal of 143100216270 is 72612001341.

143100216270 is a `hidden beast` number, since 1 + 4 + 3 + 10 + 0 + 21 + 627 + 0 = 666.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 21383625 + ... + 21390315.

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

Almost surely, 2143100216270 is an apocalyptic number.

143100216270 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 143100216270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219711744000).

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

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

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

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

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

The product of its (nonzero) digits is 2016, while the sum is 27.

The spelling of 143100216270 in words is "one hundred forty-three billion, one hundred million, two hundred sixteen thousand, two hundred seventy".