Base | Representation |
---|---|
bin | 100001100001110… |
… | …1110011111100101 |
3 | 2220101222110221011 |
4 | 1003003232133211 |
5 | 4301003102331 |
6 | 303345422221 |
7 | 36610525102 |
oct | 10303563745 |
9 | 2811873834 |
10 | 1125050341 |
11 | 528074a78 |
12 | 27493a971 |
13 | 14c111a7c |
14 | a95bdaa9 |
15 | 68b833b1 |
hex | 430ee7e5 |
1125050341 has 4 divisors (see below), whose sum is σ = 1126480672. Its totient is φ = 1123620012.
The previous prime is 1125050321. The next prime is 1125050347. The reversal of 1125050341 is 1430505211.
It is a happy number.
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 1125050341 - 211 = 1125048293 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 (1125050347) 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 3 ways as a sum of consecutive naturals, for example, 713985 + ... + 715558.
It is an arithmetic number, because the mean of its divisors is an integer number (281620168).
Almost surely, 21125050341 is an apocalyptic number.
It is an amenable number.
1125050341 is a deficient number, since it is larger than the sum of its proper divisors (1430331).
1125050341 is an equidigital number, since it uses as much as digits as its factorization.
1125050341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1430330.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1125050341 is about 33541.7700934223. The cubic root of 1125050341 is about 1040.0574244056.
Adding to 1125050341 its reverse (1430505211), we get a palindrome (2555555552).
The spelling of 1125050341 in words is "one billion, one hundred twenty-five million, fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •