Base | Representation |
---|---|
bin | 10100110100111000… |
… | …10101010001111100 |
3 | 1001212020010100100000 |
4 | 22122130111101330 |
5 | 140344322144202 |
6 | 5045252434300 |
7 | 544035245211 |
oct | 123234252174 |
9 | 31766110300 |
10 | 11181053052 |
11 | 481845a714 |
12 | 2200618990 |
13 | 10925a9930 |
14 | 780d5db08 |
15 | 45690491c |
hex | 29a71547c |
11181053052 has 72 divisors (see below), whose sum is σ = 31564654576. Its totient is φ = 3440320128.
The previous prime is 11181053041. The next prime is 11181053053. The reversal of 11181053052 is 25035018111.
11181053052 is a `hidden beast` number, since 1 + 1 + 1 + 81 + 0 + 530 + 52 = 666.
11181053052 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 (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11181053053) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 429793 + ... + 455064.
Almost surely, 211181053052 is an apocalyptic number.
11181053052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11181053052 is an abundant number, since it is smaller than the sum of its proper divisors (20383601524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11181053052 is a wasteful number, since it uses less digits than its factorization.
11181053052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 884889 (or 884875 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
The spelling of 11181053052 in words is "eleven billion, one hundred eighty-one million, fifty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •