Base | Representation |
---|---|
bin | 10100101011100111… |
… | …10101111011011100 |
3 | 1001122210212121100220 |
4 | 22111303311323130 |
5 | 140214423030022 |
6 | 5033434521340 |
7 | 542102514345 |
oct | 122563657334 |
9 | 31583777326 |
10 | 11103330012 |
11 | 47885a41a5 |
12 | 219a596250 |
13 | 107c465a78 |
14 | 7748cb0cc |
15 | 44eba085c |
hex | 295cf5edc |
11103330012 has 24 divisors (see below), whose sum is σ = 25911043200. Its totient is φ = 3700642416.
The previous prime is 11103330001. The next prime is 11103330053. The reversal of 11103330012 is 21003330111.
It is a super-3 number, since 3×111033300123 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11103329973 and 11103330000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48289 + ... + 156647.
It is an arithmetic number, because the mean of its divisors is an integer number (1079626800).
Almost surely, 211103330012 is an apocalyptic number.
11103330012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11103330012 is an abundant number, since it is smaller than the sum of its proper divisors (14807713188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11103330012 is a wasteful number, since it uses less digits than its factorization.
11103330012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116905 (or 116903 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 11103330012 its reverse (21003330111), we get a palindrome (32106660123).
Subtracting 11103330012 from its reverse (21003330111), we obtain a palindrome (9900000099).
The spelling of 11103330012 in words is "eleven billion, one hundred three million, three hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •