Base | Representation |
---|---|
bin | 101010001110… |
… | …010011011000 |
3 | 202211100022100 |
4 | 222032103120 |
5 | 10313144012 |
6 | 1033123400 |
7 | 163040031 |
oct | 52162330 |
9 | 22740270 |
10 | 11068632 |
11 | 6280033 |
12 | 3859560 |
13 | 23a70b3 |
14 | 1681a88 |
15 | e898dc |
hex | a8e4d8 |
11068632 has 48 divisors (see below), whose sum is σ = 31744440. Its totient is φ = 3472128.
The previous prime is 11068627. The next prime is 11068637. The reversal of 11068632 is 23686011.
It is an interprime number because it is at equal distance from previous prime (11068627) and next prime (11068637).
It is a super-2 number, since 2×110686322 = 245029228702848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11068596 and 11068605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11068637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3298 + ... + 5745.
Almost surely, 211068632 is an apocalyptic number.
11068632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11068632 is an abundant number, since it is smaller than the sum of its proper divisors (20675808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11068632 is a wasteful number, since it uses less digits than its factorization.
11068632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9072 (or 9065 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 11068632 is about 3326.9553648945. The cubic root of 11068632 is about 222.8595843632.
The spelling of 11068632 in words is "eleven million, sixty-eight thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •