Base | Representation |
---|---|
bin | 10011001111011001110… |
… | …111110000101100101101 |
3 | 11200101212002211012100022 |
4 | 103033121313300230231 |
5 | 133130341304430013 |
6 | 2451225350011525 |
7 | 164345413354556 |
oct | 23173167605455 |
9 | 4611762735308 |
10 | 1322210233133 |
11 | 46a823230069 |
12 | 194305646ba5 |
13 | 978b767741a |
14 | 47dd121332d |
15 | 245d8c30008 |
hex | 133d9df0b2d |
1322210233133 has 4 divisors (see below), whose sum is σ = 1322862534240. Its totient is φ = 1321557932028.
The previous prime is 1322210233121. The next prime is 1322210233139. The reversal of 1322210233133 is 3313320122231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1322210233133 - 212 = 1322210229037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322210233139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 326147513 + ... + 326151566.
It is an arithmetic number, because the mean of its divisors is an integer number (330715633560).
Almost surely, 21322210233133 is an apocalyptic number.
It is an amenable number.
1322210233133 is a deficient number, since it is larger than the sum of its proper divisors (652301107).
1322210233133 is an equidigital number, since it uses as much as digits as its factorization.
1322210233133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652301106.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 1322210233133 its reverse (3313320122231), we get a palindrome (4635530355364).
The spelling of 1322210233133 in words is "one trillion, three hundred twenty-two billion, two hundred ten million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •