Search a number
-
+
1968198201600 = 283521724373113
BaseRepresentation
bin11100101001000001110…
…000010011000100000000
320222011021010011002211220
4130221001300103010000
5224221332214422400
64104102222035040
7262124533451451
oct34510160230400
96864233132756
101968198201600
11699787634a74
12279549718a80
131137a5acc797
146b393021128
15362e60e27a0
hex1ca41c13100

1968198201600 has 1296 divisors, whose sum is σ = 7220548813632. Its totient is φ = 471670456320.

The previous prime is 1968198201523. The next prime is 1968198201637. The reversal of 1968198201600 is 61028918691.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 17417683144 + ... + 17417683256.

Almost surely, 21968198201600 is an apocalyptic number.

1968198201600 is a gapful number since it is divisible by the number (10) 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 1968198201600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3610274406816).

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

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

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

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

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

The product of its (nonzero) digits is 373248, while the sum is 51.

The spelling of 1968198201600 in words is "one trillion, nine hundred sixty-eight billion, one hundred ninety-eight million, two hundred one thousand, six hundred".