Search a number
-
+
33661419996 = 22319375379953
BaseRepresentation
bin11111010110011000…
…001000000111011100
310012212220220022101010
4133112120020013130
51022414310414441
623244105015220
72301106230501
oct372630100734
9105786808333
1033661419996
1113303aa3076
126635184510
133235acb5c9
1418b48254a8
15d202be116
hex7d66081dc

33661419996 has 192 divisors, whose sum is σ = 87700838400. Its totient is φ = 10008520704.

The previous prime is 33661419941. The next prime is 33661420021. The reversal of 33661419996 is 69991416633.

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

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 35321056 + ... + 35322008.

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

Almost surely, 233661419996 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its digits is 5668704, while the sum is 57.

The spelling of 33661419996 in words is "thirty-three billion, six hundred sixty-one million, four hundred nineteen thousand, nine hundred ninety-six".