Base | Representation |
---|---|
bin | 10100110011001001… |
… | …11100011101000011 |
3 | 1001211012210200011201 |
4 | 22121210330131003 |
5 | 140332113032233 |
6 | 5044013322031 |
7 | 543500653042 |
oct | 123144743503 |
9 | 31735720151 |
10 | 11166533443 |
11 | 481024293a |
12 | 21b7796317 |
13 | 108c594b50 |
14 | 77d060559 |
15 | 4554d777d |
hex | 29993c743 |
11166533443 has 8 divisors (see below), whose sum is σ = 12079426688. Its totient is φ = 10261344384.
The previous prime is 11166533429. The next prime is 11166533459. The reversal of 11166533443 is 34433566111.
11166533443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11166533443 - 217 = 11166402371 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11166533473) 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 7 ways as a sum of consecutive naturals, for example, 1923030 + ... + 1928827.
It is an arithmetic number, because the mean of its divisors is an integer number (1509928336).
Almost surely, 211166533443 is an apocalyptic number.
11166533443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11166533443 is a deficient number, since it is larger than the sum of its proper divisors (912893245).
11166533443 is a wasteful number, since it uses less digits than its factorization.
11166533443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3852093.
The product of its digits is 77760, while the sum is 37.
The spelling of 11166533443 in words is "eleven billion, one hundred sixty-six million, five hundred thirty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •