Base | Representation |
---|---|
bin | 10100100100011001… |
… | …10110111110011000 |
3 | 1001111120221022001000 |
4 | 22102030312332120 |
5 | 140103422412112 |
6 | 5023433025000 |
7 | 540436034025 |
oct | 122214667630 |
9 | 31446838030 |
10 | 11042779032 |
11 | 47573a736a |
12 | 2182255160 |
13 | 106ca5509c |
14 | 76a84854c |
15 | 4496de7dc |
hex | 292336f98 |
11042779032 has 64 divisors (see below), whose sum is σ = 30915993600. Its totient is φ = 3651933600.
The previous prime is 11042779003. The next prime is 11042779087. The reversal of 11042779032 is 23097724011.
11042779032 is a `hidden beast` number, since 110 + 427 + 7 + 90 + 32 = 666.
11042779032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 15 ways as a sum of consecutive naturals, for example, 173844 + ... + 228707.
It is an arithmetic number, because the mean of its divisors is an integer number (483062400).
Almost surely, 211042779032 is an apocalyptic number.
11042779032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11042779032 is an abundant number, since it is smaller than the sum of its proper divisors (19873214568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11042779032 is a wasteful number, since it uses less digits than its factorization.
11042779032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402693 (or 402683 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The spelling of 11042779032 in words is "eleven billion, forty-two million, seven hundred seventy-nine thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •