Base | Representation |
---|---|
bin | 111110101000001… |
… | …001100101101100 |
3 | 2201020002201111010 |
4 | 332220021211230 |
5 | 4122440244203 |
6 | 252132225220 |
7 | 35015623353 |
oct | 7650114554 |
9 | 2636081433 |
10 | 1050712428 |
11 | 49a110887 |
12 | 253a6b210 |
13 | 1398b493c |
14 | 9d78c99a |
15 | 6239c303 |
hex | 3ea0996c |
1050712428 has 24 divisors (see below), whose sum is σ = 2452191280. Its totient is φ = 350161920.
The previous prime is 1050712409. The next prime is 1050712447. The reversal of 1050712428 is 8242170501.
1050712428 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1050712409) and next prime (1050712447).
It is a super-2 number, since 2×10507124282 = 2207993212707310368, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050712395 and 1050712404.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92568 + ... + 103296.
Almost surely, 21050712428 is an apocalyptic number.
It is an amenable number.
1050712428 is an abundant number, since it is smaller than the sum of its proper divisors (1401478852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050712428 is a wasteful number, since it uses less digits than its factorization.
1050712428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18897 (or 18895 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 30.
The square root of 1050712428 is about 32414.6946306764. The cubic root of 1050712428 is about 1016.6261807880.
Adding to 1050712428 its reverse (8242170501), we get a palindrome (9292882929).
The spelling of 1050712428 in words is "one billion, fifty million, seven hundred twelve thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •