Base | Representation |
---|---|
bin | 10100100011001111… |
… | …00110101111011010 |
3 | 1001110220120010211220 |
4 | 22101213212233122 |
5 | 140043422410320 |
6 | 5022443432510 |
7 | 540260031162 |
oct | 122147465732 |
9 | 31426503756 |
10 | 11033013210 |
11 | 475193713a |
12 | 217ab25736 |
13 | 106aa15cab |
14 | 7694255a2 |
15 | 448910e40 |
hex | 2919e6bda |
11033013210 has 64 divisors (see below), whose sum is σ = 26827573248. Its totient is φ = 2903511104.
The previous prime is 11033013179. The next prime is 11033013223. The reversal of 11033013210 is 1231033011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11033013210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3043459 + ... + 3047081.
It is an arithmetic number, because the mean of its divisors is an integer number (419180832).
Almost surely, 211033013210 is an apocalyptic number.
11033013210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11033013210 is an abundant number, since it is smaller than the sum of its proper divisors (15794560038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033013210 is a wasteful number, since it uses less digits than its factorization.
11033013210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4939.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 11033013210 its reverse (1231033011), we get a palindrome (12264046221).
The spelling of 11033013210 in words is "eleven billion, thirty-three million, thirteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •