Base | Representation |
---|---|
bin | 100010000010010… |
… | …0011001011101101 |
3 | 2221120221210222201 |
4 | 1010010203023231 |
5 | 4314330341443 |
6 | 305153541501 |
7 | 40205131342 |
oct | 10404431355 |
9 | 2846853881 |
10 | 1142043373 |
11 | 5367210a9 |
12 | 27a574891 |
13 | 1527b1613 |
14 | ab9647c9 |
15 | 6a3dd34d |
hex | 441232ed |
1142043373 has 2 divisors, whose sum is σ = 1142043374. Its totient is φ = 1142043372.
The previous prime is 1142043367. The next prime is 1142043437. The reversal of 1142043373 is 3733402411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1131784164 + 10259209 = 33642^2 + 3203^2 .
It is an emirp because it is prime and its reverse (3733402411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1142043373 - 217 = 1141912301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1142043313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571021686 + 571021687.
It is an arithmetic number, because the mean of its divisors is an integer number (571021687).
Almost surely, 21142043373 is an apocalyptic number.
It is an amenable number.
1142043373 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142043373 is an equidigital number, since it uses as much as digits as its factorization.
1142043373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 1142043373 is about 33794.1322273557. The cubic root of 1142043373 is about 1045.2677055034.
Adding to 1142043373 its reverse (3733402411), we get a palindrome (4875445784).
The spelling of 1142043373 in words is "one billion, one hundred forty-two million, forty-three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •