Base | Representation |
---|---|
bin | 1010000010001101010000… |
… | …0000111011111010000100 |
3 | 1110001202012001010112110010 |
4 | 2200203110000323322010 |
5 | 2421231122424000200 |
6 | 35244301100030220 |
7 | 2216052562260120 |
oct | 240432400737204 |
9 | 43052161115403 |
10 | 11033033031300 |
11 | 35740a0574285 |
12 | 12a2338532370 |
13 | 620544c97317 |
14 | 2a2004744580 |
15 | 141edb6ee150 |
hex | a08d403be84 |
11033033031300 has 144 divisors (see below), whose sum is σ = 36484546839552. Its totient is φ = 2521698960000.
The previous prime is 11033033031277. The next prime is 11033033031311. The reversal of 11033033031300 is 313033033011.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 47 ways as a sum of consecutive naturals, for example, 41344099 + ... + 41610101.
It is an arithmetic number, because the mean of its divisors is an integer number (253364908608).
Almost surely, 211033033031300 is an apocalyptic number.
11033033031300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11033033031300 is an abundant number, since it is smaller than the sum of its proper divisors (25451513808252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033033031300 is a wasteful number, since it uses less digits than its factorization.
11033033031300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285778 (or 285771 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 11033033031300 its reverse (313033033011), we get a palindrome (11346066064311).
The spelling of 11033033031300 in words is "eleven trillion, thirty-three billion, thirty-three million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •