Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11001010110011110 |
3 | 1001110000021202111211 |
4 | 22100312121112132 |
5 | 140032122111220 |
6 | 5021303135034 |
7 | 540042263143 |
oct | 122066312636 |
9 | 31400252454 |
10 | 11020113310 |
11 | 4745626268 |
12 | 217674447a |
13 | 106814a50b |
14 | 7678283ca |
15 | 447713b5a |
hex | 290d9959e |
11020113310 has 8 divisors (see below), whose sum is σ = 19836203976. Its totient is φ = 4408045320.
The previous prime is 11020113287. The next prime is 11020113323. The reversal of 11020113310 is 1331102011.
11020113310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×110201133103 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 3 ways as a sum of consecutive naturals, for example, 551005656 + ... + 551005675.
It is an arithmetic number, because the mean of its divisors is an integer number (2479525497).
Almost surely, 211020113310 is an apocalyptic number.
11020113310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11020113310 is a deficient number, since it is larger than the sum of its proper divisors (8816090666).
11020113310 is a wasteful number, since it uses less digits than its factorization.
11020113310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102011338.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11020113310 its reverse (1331102011), we get a palindrome (12351215321).
The spelling of 11020113310 in words is "eleven billion, twenty million, one hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •