Base | Representation |
---|---|
bin | 1010000001101100101110… |
… | …1111100011010111011010 |
3 | 1110000220122201112011022212 |
4 | 2200123023233203113122 |
5 | 2421110233401301020 |
6 | 35240255005315122 |
7 | 2215323352414100 |
oct | 240331357432732 |
9 | 43026581464285 |
10 | 11024304322010 |
11 | 3570421428851 |
12 | 12a0701265aa2 |
13 | 61c7837a2495 |
14 | 2a181738bc70 |
15 | 141b7a25ecc5 |
hex | a06cbbe35da |
11024304322010 has 48 divisors (see below), whose sum is σ = 24441398844264. Its totient is φ = 3557422568448.
The previous prime is 11024304321971. The next prime is 11024304322049. The reversal of 11024304322010 is 1022340342011.
It is an interprime number because it is at equal distance from previous prime (11024304321971) and next prime (11024304322049).
It can be written as a sum of positive squares in 4 ways, for example, as 9739760897881 + 1284543424129 = 3120859^2 + 1133377^2 .
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 661714619 + ... + 661731278.
Almost surely, 211024304322010 is an apocalyptic number.
11024304322010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11024304322010 is an abundant number, since it is smaller than the sum of its proper divisors (13417094522254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11024304322010 is a wasteful number, since it uses less digits than its factorization.
11024304322010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1323445935 (or 1323445928 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 11024304322010 its reverse (1022340342011), we get a palindrome (12046644664021).
The spelling of 11024304322010 in words is "eleven trillion, twenty-four billion, three hundred four million, three hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •