Base | Representation |
---|---|
bin | 100001110001100… |
… | …1111110001001111 |
3 | 2220222112021022101 |
4 | 1003203033301033 |
5 | 4310112004403 |
6 | 304242455531 |
7 | 40041000556 |
oct | 10343176117 |
9 | 2828467271 |
10 | 1133313103 |
11 | 5317a89aa |
12 | 2776645a7 |
13 | 150a45990 |
14 | aa730d9d |
15 | 6976671d |
hex | 438cfc4f |
1133313103 has 16 divisors (see below), whose sum is σ = 1252440000. Its totient is φ = 1018840320.
The previous prime is 1133313089. The next prime is 1133313113. The reversal of 1133313103 is 3013133311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1133313103 - 221 = 1131215951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133313113) by changing a digit.
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, 376398 + ... + 379396.
It is an arithmetic number, because the mean of its divisors is an integer number (78277500).
Almost surely, 21133313103 is an apocalyptic number.
1133313103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1133313103 is a deficient number, since it is larger than the sum of its proper divisors (119126897).
1133313103 is a wasteful number, since it uses less digits than its factorization.
1133313103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3762.
The product of its (nonzero) digits is 243, while the sum is 19.
The square root of 1133313103 is about 33664.7159946434. The cubic root of 1133313103 is about 1042.5973978283.
Adding to 1133313103 its reverse (3013133311), we get a palindrome (4146446414).
The spelling of 1133313103 in words is "one billion, one hundred thirty-three million, three hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •