Search a number
-
+
1049099076936 = 23361743733371
BaseRepresentation
bin11110100010000110010…
…11011000010101001000
310201021220111222222000000
433101003023120111020
5114142023330430221
62121541030043000
7135536440006641
oct17210313302510
93637814888000
101049099076936
11374a14096129
1214b3a51a9460
1377c114aa9a1
1438ac325a6c8
151c451e9ae26
hexf4432d8548

1049099076936 has 448 divisors, whose sum is σ = 3240081155520. Its totient is φ = 316977131520.

The previous prime is 1049099076913. The next prime is 1049099076943. The reversal of 1049099076936 is 6396709909401.

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

It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.

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 111 ways as a sum of consecutive naturals, for example, 311211331 + ... + 311214701.

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

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

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

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

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

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

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

The spelling of 1049099076936 in words is "one trillion, forty-nine billion, ninety-nine million, seventy-six thousand, nine hundred thirty-six".