Base | Representation |
---|---|
bin | 10001110011010011000… |
… | …001010000001100101101 |
3 | 11022221120122112021210222 |
4 | 101303103001100030231 |
5 | 130020320111030013 |
6 | 2333551544541125 |
7 | 154244534133530 |
oct | 21632301201455 |
9 | 4287518467728 |
10 | 1223311033133 |
11 | 431892206332 |
12 | 1791044817a5 |
13 | 8b485c38837 |
14 | 432cc45ca17 |
15 | 21c4b488508 |
hex | 11cd305032d |
1223311033133 has 8 divisors (see below), whose sum is σ = 1404174862080. Its totient is φ = 1043973481680.
The previous prime is 1223311033103. The next prime is 1223311033151. The reversal of 1223311033133 is 3313301133221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1223311033133 - 212 = 1223311029037 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 (1223311033103) 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 7 ways as a sum of consecutive naturals, for example, 381567653 + ... + 381570858.
It is an arithmetic number, because the mean of its divisors is an integer number (175521857760).
Almost surely, 21223311033133 is an apocalyptic number.
It is an amenable number.
1223311033133 is a deficient number, since it is larger than the sum of its proper divisors (180863828947).
1223311033133 is an equidigital number, since it uses as much as digits as its factorization.
1223311033133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763138747.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1223311033133 its reverse (3313301133221), we get a palindrome (4536612166354).
The spelling of 1223311033133 in words is "one trillion, two hundred twenty-three billion, three hundred eleven million, thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •