Base | Representation |
---|---|
bin | 10000100110000110011… |
… | …101001100010110110101 |
3 | 11001000121222102220002012 |
4 | 100212012131030112311 |
5 | 122141041031230143 |
6 | 2231522552054005 |
7 | 145251503122211 |
oct | 20460635142665 |
9 | 4030558386065 |
10 | 1140422133173 |
11 | 3aa717621a24 |
12 | 165031094305 |
13 | 8370644b47b |
14 | 3d2a7b5b941 |
15 | 1e9e956e418 |
hex | 1098674c5b5 |
1140422133173 has 2 divisors, whose sum is σ = 1140422133174. Its totient is φ = 1140422133172.
The previous prime is 1140422133133. The next prime is 1140422133211. The reversal of 1140422133173 is 3713312240411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1140404002609 + 18130564 = 1067897^2 + 4258^2 .
It is a cyclic number.
It is not a de Polignac number, because 1140422133173 - 220 = 1140421084597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1140422133133) 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, 570211066586 + 570211066587.
It is an arithmetic number, because the mean of its divisors is an integer number (570211066587).
Almost surely, 21140422133173 is an apocalyptic number.
It is an amenable number.
1140422133173 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140422133173 is an equidigital number, since it uses as much as digits as its factorization.
1140422133173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 1140422133173 its reverse (3713312240411), we get a palindrome (4853734373584).
The spelling of 1140422133173 in words is "one trillion, one hundred forty billion, four hundred twenty-two million, one hundred thirty-three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •