Base | Representation |
---|---|
bin | 11101110000001111011… |
… | …00000111010011000101 |
3 | 10121201211000120000000022 |
4 | 32320013230013103011 |
5 | 113222213243034224 |
6 | 2101352534024525 |
7 | 133601215000115 |
oct | 16700754072305 |
9 | 3551730500008 |
10 | 1022331221189 |
11 | 36462835a9a3 |
12 | 1461747a8145 |
13 | 7553692a3a5 |
14 | 376a41a7045 |
15 | 1b8d6ebe65e |
hex | ee07b074c5 |
1022331221189 has 2 divisors, whose sum is σ = 1022331221190. Its totient is φ = 1022331221188.
The previous prime is 1022331221179. The next prime is 1022331221227. The reversal of 1022331221189 is 9811221332201.
1022331221189 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 915385870564 + 106945350625 = 956758^2 + 327025^2 .
It is a cyclic number.
It is not a de Polignac number, because 1022331221189 - 212 = 1022331217093 is a prime.
It is a super-2 number, since 2×10223312211892 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022331221179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511165610594 + 511165610595.
It is an arithmetic number, because the mean of its divisors is an integer number (511165610595).
Almost surely, 21022331221189 is an apocalyptic number.
It is an amenable number.
1022331221189 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022331221189 is an equidigital number, since it uses as much as digits as its factorization.
1022331221189 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 35.
The spelling of 1022331221189 in words is "one trillion, twenty-two billion, three hundred thirty-one million, two hundred twenty-one thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •