Base | Representation |
---|---|
bin | 11110100100011001000… |
… | …11010111110101100111 |
3 | 10201102002022101120111020 |
4 | 33102030203113311213 |
5 | 114202034001300033 |
6 | 2122303123142223 |
7 | 135612105366426 |
oct | 17221443276547 |
9 | 3642068346436 |
10 | 1050330103143 |
11 | 375495a63362 |
12 | 14b689514973 |
13 | 78079546269 |
14 | 38b9c9452bd |
15 | 1c4c50b46b3 |
hex | f48c8d7d67 |
1050330103143 has 4 divisors (see below), whose sum is σ = 1400440137528. Its totient is φ = 700220068760.
The previous prime is 1050330103091. The next prime is 1050330103169. The reversal of 1050330103143 is 3413010330501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1050330103143 - 29 = 1050330102631 is a prime.
It is a super-2 number, since 2×10503301031432 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050330103183) 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, 175055017188 + ... + 175055017193.
It is an arithmetic number, because the mean of its divisors is an integer number (350110034382).
Almost surely, 21050330103143 is an apocalyptic number.
1050330103143 is a deficient number, since it is larger than the sum of its proper divisors (350110034385).
1050330103143 is an equidigital number, since it uses as much as digits as its factorization.
1050330103143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350110034384.
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 1050330103143 its reverse (3413010330501), we get a palindrome (4463340433644).
The spelling of 1050330103143 in words is "one trillion, fifty billion, three hundred thirty million, one hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •