Base | Representation |
---|---|
bin | 10100100011001111… |
… | …01010110110011000 |
3 | 1001110220120222221020 |
4 | 22101213222312120 |
5 | 140043423430130 |
6 | 5022444042440 |
7 | 540260131224 |
oct | 122147526630 |
9 | 31426528836 |
10 | 11033030040 |
11 | 475194884a |
12 | 217ab33420 |
13 | 106aa20856 |
14 | 76942b784 |
15 | 448915e10 |
hex | 2919ead98 |
11033030040 has 64 divisors (see below), whose sum is σ = 33803343360. Its totient is φ = 2879541120.
The previous prime is 11033030023. The next prime is 11033030051. The reversal of 11033030040 is 4003033011.
11033030040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 972466 + ... + 983745.
It is an arithmetic number, because the mean of its divisors is an integer number (528177240).
Almost surely, 211033030040 is an apocalyptic number.
11033030040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11033030040 is an abundant number, since it is smaller than the sum of its proper divisors (22770313320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033030040 is a wasteful number, since it uses less digits than its factorization.
11033030040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1956272 (or 1956268 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 11033030040 its reverse (4003033011), we get a palindrome (15036063051).
The spelling of 11033030040 in words is "eleven billion, thirty-three million, thirty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •