Base | Representation |
---|---|
bin | 10000100110000011101… |
… | …111111111101001001101 |
3 | 11001000111211000011220012 |
4 | 100212003233333221031 |
5 | 122140442420331224 |
6 | 2231514251003005 |
7 | 145250412162044 |
oct | 20460357775115 |
9 | 4030454004805 |
10 | 1140376730189 |
11 | 3aa6a3a30aa4 |
12 | 165019a39465 |
13 | 836c9c125b8 |
14 | 3d2a1add55b |
15 | 1e9e55a180e |
hex | 10983bffa4d |
1140376730189 has 4 divisors (see below), whose sum is σ = 1143821977440. Its totient is φ = 1136931482940.
The previous prime is 1140376730179. The next prime is 1140376730203. The reversal of 1140376730189 is 9810376730411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1140376730189 - 216 = 1140376664653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140376730179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1722623129 + ... + 1722623790.
It is an arithmetic number, because the mean of its divisors is an integer number (285955494360).
Almost surely, 21140376730189 is an apocalyptic number.
It is an amenable number.
1140376730189 is a deficient number, since it is larger than the sum of its proper divisors (3445247251).
1140376730189 is an equidigital number, since it uses as much as digits as its factorization.
1140376730189 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3445247250.
The product of its (nonzero) digits is 762048, while the sum is 50.
The spelling of 1140376730189 in words is "one trillion, one hundred forty billion, three hundred seventy-six million, seven hundred thirty thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •