Base | Representation |
---|---|
bin | 100001111100001001001… |
… | …110101111011110001101 |
3 | 22020222010112111201222222 |
4 | 201330021032233132031 |
5 | 301203043424214013 |
6 | 4543242020545125 |
7 | 330335054520413 |
oct | 41741116573615 |
9 | 8228115451888 |
10 | 2332322101133 |
11 | 81a150028062 |
12 | 318029b521a5 |
13 | 13bc2486aabb |
14 | 80c565bd2b3 |
15 | 40a080a0508 |
hex | 21f093af78d |
2332322101133 has 2 divisors, whose sum is σ = 2332322101134. Its totient is φ = 2332322101132.
The previous prime is 2332322101129. The next prime is 2332322101163. The reversal of 2332322101133 is 3311012232332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2226308694724 + 106013406409 = 1492082^2 + 325597^2 .
It is a cyclic number.
It is not a de Polignac number, because 2332322101133 - 22 = 2332322101129 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2332322101163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1166161050566 + 1166161050567.
It is an arithmetic number, because the mean of its divisors is an integer number (1166161050567).
Almost surely, 22332322101133 is an apocalyptic number.
It is an amenable number.
2332322101133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2332322101133 is an equidigital number, since it uses as much as digits as its factorization.
2332322101133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 2332322101133 its reverse (3311012232332), we get a palindrome (5643334333465).
The spelling of 2332322101133 in words is "two trillion, three hundred thirty-two billion, three hundred twenty-two million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •