Base | Representation |
---|---|
bin | 100010000010010… |
… | …0010110110001001 |
3 | 2221120221202002121 |
4 | 1010010202312021 |
5 | 4314330320433 |
6 | 305153531241 |
7 | 40205124331 |
oct | 10404426611 |
9 | 2846852077 |
10 | 1142041993 |
11 | 536720064 |
12 | 27a573b21 |
13 | 1527b0ac1 |
14 | ab9640c1 |
15 | 6a3dcc2d |
hex | 44122d89 |
1142041993 has 2 divisors, whose sum is σ = 1142041994. Its totient is φ = 1142041992.
The previous prime is 1142041991. The next prime is 1142042051. The reversal of 1142041993 is 3991402411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 748733769 + 393308224 = 27363^2 + 19832^2 .
It is an emirp because it is prime and its reverse (3991402411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1142041993 - 21 = 1142041991 is a prime.
Together with 1142041991, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1142041991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571020996 + 571020997.
It is an arithmetic number, because the mean of its divisors is an integer number (571020997).
Almost surely, 21142041993 is an apocalyptic number.
It is an amenable number.
1142041993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142041993 is an equidigital number, since it uses as much as digits as its factorization.
1142041993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 34.
The square root of 1142041993 is about 33794.1118096038. Note that the first 3 decimals coincide. The cubic root of 1142041993 is about 1045.2672844832.
The spelling of 1142041993 in words is "one billion, one hundred forty-two million, forty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •