Base | Representation |
---|---|
bin | 10000010101001111100… |
… | …000010010111001011101 |
3 | 10222021220102201000210222 |
4 | 100111033200102321131 |
5 | 121342003001032313 |
6 | 2215330431411125 |
7 | 144041100255626 |
oct | 20251740227135 |
9 | 3867812630728 |
10 | 1122320330333 |
11 | 3a2a78627594 |
12 | 16161a983aa5 |
13 | 81ab00c5927 |
14 | 3c46b9d0a4d |
15 | 1e2da2a7208 |
hex | 1054f812e5d |
1122320330333 has 2 divisors, whose sum is σ = 1122320330334. Its totient is φ = 1122320330332.
The previous prime is 1122320330321. The next prime is 1122320330381. The reversal of 1122320330333 is 3330330232211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1006695168964 + 115625161369 = 1003342^2 + 340037^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122320330333 - 224 = 1122303553117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122320338333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561160165166 + 561160165167.
It is an arithmetic number, because the mean of its divisors is an integer number (561160165167).
Almost surely, 21122320330333 is an apocalyptic number.
It is an amenable number.
1122320330333 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122320330333 is an equidigital number, since it uses as much as digits as its factorization.
1122320330333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 1122320330333 its reverse (3330330232211), we get a palindrome (4452650562544).
The spelling of 1122320330333 in words is "one trillion, one hundred twenty-two billion, three hundred twenty million, three hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •