Base | Representation |
---|---|
bin | 111110100110010… |
… | …010101000000001 |
3 | 2201012011222001220 |
4 | 332212102220001 |
5 | 4122324201103 |
6 | 252113545253 |
7 | 35011523625 |
oct | 7646225001 |
9 | 2635158056 |
10 | 1050225153 |
11 | 49990877a |
12 | 253875229 |
13 | 139773c03 |
14 | 9d6a3185 |
15 | 62302c53 |
hex | 3e992a01 |
1050225153 has 8 divisors (see below), whose sum is σ = 1401614400. Its totient is φ = 699493008.
The previous prime is 1050225139. The next prime is 1050225179. The reversal of 1050225153 is 3515220501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1050225153 - 26 = 1050225089 is a prime.
It is a super-2 number, since 2×10502251532 = 2205945743987746818, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1050225853) 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 in 7 ways as a sum of consecutive naturals, for example, 160533 + ... + 166946.
It is an arithmetic number, because the mean of its divisors is an integer number (175201800).
Almost surely, 21050225153 is an apocalyptic number.
It is an amenable number.
1050225153 is a deficient number, since it is larger than the sum of its proper divisors (351389247).
1050225153 is a wasteful number, since it uses less digits than its factorization.
1050225153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328551.
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 1050225153 is about 32407.1774920310. The cubic root of 1050225153 is about 1016.4690007303.
Adding to 1050225153 its reverse (3515220501), we get a palindrome (4565445654).
The spelling of 1050225153 in words is "one billion, fifty million, two hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •