Base | Representation |
---|---|
bin | 111100111011101… |
… | …111010010010101 |
3 | 2122020121212112221 |
4 | 330323233102111 |
5 | 4043201340031 |
6 | 245235142341 |
7 | 34222230322 |
oct | 7473572225 |
9 | 2566555487 |
10 | 1022293141 |
11 | 48506aa71 |
12 | 2464449b1 |
13 | 133a442ac |
14 | 99ab1b49 |
15 | 5eb36a11 |
hex | 3ceef495 |
1022293141 has 2 divisors, whose sum is σ = 1022293142. Its totient is φ = 1022293140.
The previous prime is 1022293127. The next prime is 1022293159. The reversal of 1022293141 is 1413922201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 798910225 + 223382916 = 28265^2 + 14946^2 .
It is an emirp because it is prime and its reverse (1413922201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022293141 - 229 = 485422229 is a prime.
It is a super-2 number, since 2×10222931412 = 2090166532271291762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022293171) 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, 511146570 + 511146571.
It is an arithmetic number, because the mean of its divisors is an integer number (511146571).
Almost surely, 21022293141 is an apocalyptic number.
It is an amenable number.
1022293141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022293141 is an equidigital number, since it uses as much as digits as its factorization.
1022293141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 1022293141 is about 31973.3192052374. The cubic root of 1022293141 is about 1007.3765004492.
The spelling of 1022293141 in words is "one billion, twenty-two million, two hundred ninety-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •