Base | Representation |
---|---|
bin | 10100100011010001… |
… | …10100001001000000 |
3 | 1001110221011020201202 |
4 | 22101220310021000 |
5 | 140044013031430 |
6 | 5022454320332 |
7 | 540262521362 |
oct | 122150641100 |
9 | 31427136652 |
10 | 11033330240 |
11 | 4752033349 |
12 | 217b0590a8 |
13 | 106aac739a |
14 | 7694a8d32 |
15 | 448974d45 |
hex | 291a34240 |
11033330240 has 28 divisors (see below), whose sum is σ = 26273118396. Its totient is φ = 4413331968.
The previous prime is 11033330239. The next prime is 11033330251. The reversal of 11033330240 is 4203333011.
It can be written as a sum of positive squares in 2 ways, for example, as 5373476416 + 5659853824 = 73304^2 + 75232^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 17239259 + ... + 17239898.
It is an arithmetic number, because the mean of its divisors is an integer number (938325657).
Almost surely, 211033330240 is an apocalyptic number.
11033330240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11033330240 is an abundant number, since it is smaller than the sum of its proper divisors (15239788156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033330240 is an equidigital number, since it uses as much as digits as its factorization.
11033330240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34479174 (or 34479164 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 11033330240 its reverse (4203333011), we get a palindrome (15236663251).
The spelling of 11033330240 in words is "eleven billion, thirty-three million, three hundred thirty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •