Base | Representation |
---|---|
bin | 10000100101110100000… |
… | …010110000101010010111 |
3 | 11000222211110011011210011 |
4 | 100211310002300222113 |
5 | 122134422440322403 |
6 | 2231432154541051 |
7 | 145241032264423 |
oct | 20456402605227 |
9 | 4028743134704 |
10 | 1140113214103 |
11 | 3aa579206506 |
12 | 164b65737787 |
13 | 83687449b16 |
14 | 3d278b05b83 |
15 | 1e9cc39ca6d |
hex | 109740b0a97 |
1140113214103 has 8 divisors (see below), whose sum is σ = 1217022261120. Its totient is φ = 1064894475960.
The previous prime is 1140113214091. The next prime is 1140113214139. The reversal of 1140113214103 is 3014123110411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1140113214103 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 (1140113214143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 422575825 + ... + 422578522.
It is an arithmetic number, because the mean of its divisors is an integer number (152127782640).
Almost surely, 21140113214103 is an apocalyptic number.
1140113214103 is a deficient number, since it is larger than the sum of its proper divisors (76909047017).
1140113214103 is an equidigital number, since it uses as much as digits as its factorization.
1140113214103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845154437.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 1140113214103 its reverse (3014123110411), we get a palindrome (4154236324514).
The spelling of 1140113214103 in words is "one trillion, one hundred forty billion, one hundred thirteen million, two hundred fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.261 sec. • engine limits •