Base | Representation |
---|---|
bin | 10100110011000110… |
… | …00010100001110000 |
3 | 1001211011212022010000 |
4 | 22121203002201300 |
5 | 140332001042112 |
6 | 5043554510000 |
7 | 543463503036 |
oct | 123143024160 |
9 | 31734768100 |
10 | 11166034032 |
11 | 480aa316aa |
12 | 21b7595300 |
13 | 108c44b73a |
14 | 77cd70556 |
15 | 4554397dc |
hex | 2998c2870 |
11166034032 has 50 divisors (see below), whose sum is σ = 32317745768. Its totient is φ = 3722010912.
The previous prime is 11166034007. The next prime is 11166034039. The reversal of 11166034032 is 23043066111.
11166034032 is a `hidden beast` number, since 1 + 1 + 16 + 603 + 40 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11166033987 and 11166034005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11166034039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 4306588 + ... + 4309179.
Almost surely, 211166034032 is an apocalyptic number.
11166034032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11166034032 is an abundant number, since it is smaller than the sum of its proper divisors (21151711736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11166034032 is an equidigital number, since it uses as much as digits as its factorization.
11166034032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8615787 (or 8615772 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 11166034032 in words is "eleven billion, one hundred sixty-six million, thirty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •