Base | Representation |
---|---|
bin | 101011001001… |
… | …001010000000 |
3 | 210021120222122 |
4 | 223021022000 |
5 | 10343402241 |
6 | 1042223412 |
7 | 165062606 |
oct | 53111200 |
9 | 23246878 |
10 | 11309696 |
11 | 6425162 |
12 | 3954b68 |
13 | 245ca38 |
14 | 1705876 |
15 | ed604b |
hex | ac9280 |
11309696 has 32 divisors (see below), whose sum is σ = 22720500. Its totient is φ = 5607424.
The previous prime is 11309689. The next prime is 11309707. The reversal of 11309696 is 69690311.
It can be written as a sum of positive squares in 2 ways, for example, as 11022400 + 287296 = 3320^2 + 536^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×113096962 = 255818447224832, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18776 + ... + 19368.
Almost surely, 211309696 is an apocalyptic number.
11309696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11309696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11360250).
11309696 is an abundant number, since it is smaller than the sum of its proper divisors (11410804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11309696 is an equidigital number, since it uses as much as digits as its factorization.
11309696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 756 (or 744 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 35.
The square root of 11309696 is about 3362.9891465778. The cubic root of 11309696 is about 224.4658671692.
The spelling of 11309696 in words is "eleven million, three hundred nine thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •