Base | Representation |
---|---|
bin | 10101000101111111… |
… | …00101100011000010 |
3 | 1002020020001211122001 |
4 | 22202333211203002 |
5 | 141143033344300 |
6 | 5111415334214 |
7 | 550426524166 |
oct | 124277454302 |
9 | 32206054561 |
10 | 11324512450 |
11 | 48914348a9 |
12 | 224068136a |
13 | 10b6228754 |
14 | 796024ca6 |
15 | 4642e116a |
hex | 2a2fe58c2 |
11324512450 has 12 divisors (see below), whose sum is σ = 21063593250. Its totient is φ = 4529804960.
The previous prime is 11324512429. The next prime is 11324512471. The reversal of 11324512450 is 5421542311.
11324512450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11324512429) and next prime (11324512471).
It can be written as a sum of positive squares in 3 ways, for example, as 10652510521 + 672001929 = 103211^2 + 25923^2 .
It is a super-3 number, since 3×113245124503 (a number of 31 digits) contains 333 as substring.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 113245075 + ... + 113245174.
Almost surely, 211324512450 is an apocalyptic number.
11324512450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11324512450 is a deficient number, since it is larger than the sum of its proper divisors (9739080800).
11324512450 is a wasteful number, since it uses less digits than its factorization.
11324512450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226490261 (or 226490256 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The spelling of 11324512450 in words is "eleven billion, three hundred twenty-four million, five hundred twelve thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •