Base | Representation |
---|---|
bin | 10000011111011111111… |
… | …011001011010111111101 |
3 | 11000100022221102100120121 |
4 | 100133133323023113331 |
5 | 122032031301343401 |
6 | 2224351320214541 |
7 | 144611024342221 |
oct | 20373773132775 |
9 | 4010287370517 |
10 | 1133333231101 |
11 | 3a770a076975 |
12 | 16379300a451 |
13 | 82b468b9266 |
14 | 3cbd449c781 |
15 | 1e732043ca1 |
hex | 107dfecb5fd |
1133333231101 has 8 divisors (see below), whose sum is σ = 1200019429944. Its totient is φ = 1066649203200.
The previous prime is 1133333230963. The next prime is 1133333231207. The reversal of 1133333231101 is 1011323333311.
It can be written as a sum of positive squares in 4 ways, for example, as 949116299076 + 184216932025 = 974226^2 + 429205^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1133333231101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133333238101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 600951 + ... + 1621051.
It is an arithmetic number, because the mean of its divisors is an integer number (150002428743).
Almost surely, 21133333231101 is an apocalyptic number.
It is an amenable number.
1133333231101 is a deficient number, since it is larger than the sum of its proper divisors (66686198843).
1133333231101 is a wasteful number, since it uses less digits than its factorization.
1133333231101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1085471.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 1133333231101 its reverse (1011323333311), we get a palindrome (2144656564412).
The spelling of 1133333231101 in words is "one trillion, one hundred thirty-three billion, three hundred thirty-three million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.992 sec. • engine limits •