Base | Representation |
---|---|
bin | 10000000011100010100… |
… | …001010001110001010101 |
3 | 10220110211201011220112102 |
4 | 100003202201101301111 |
5 | 121034040333032013 |
6 | 2202504325131445 |
7 | 142466046165305 |
oct | 20034241216125 |
9 | 3813751156472 |
10 | 1103312002133 |
11 | 395a03953240 |
12 | 1599b4b59b85 |
13 | 80071000553 |
14 | 3b5872c9605 |
15 | 1da76624d58 |
hex | 100e2851c55 |
1103312002133 has 8 divisors (see below), whose sum is σ = 1215298658496. Its totient is φ = 993272940000.
The previous prime is 1103312002043. The next prime is 1103312002147. The reversal of 1103312002133 is 3312002133011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1103312002133 - 230 = 1102238260309 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 (1103312004133) 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, 486897368 + ... + 486899633.
It is an arithmetic number, because the mean of its divisors is an integer number (151912332312).
Almost surely, 21103312002133 is an apocalyptic number.
It is an amenable number.
1103312002133 is a deficient number, since it is larger than the sum of its proper divisors (111986656363).
1103312002133 is a wasteful number, since it uses less digits than its factorization.
1103312002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 973797115.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1103312002133 its reverse (3312002133011), we get a palindrome (4415314135144).
The spelling of 1103312002133 in words is "one trillion, one hundred three billion, three hundred twelve million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •