Base | Representation |
---|---|
bin | 111110100111000… |
… | …011001110111101 |
3 | 2201012120002011222 |
4 | 332213003032331 |
5 | 4122402034003 |
6 | 252122123125 |
7 | 35013313244 |
oct | 7647031675 |
9 | 2635502158 |
10 | 1050424253 |
11 | 499a3431a |
12 | 2539504a5 |
13 | 139813718 |
14 | 9d71595b |
15 | 62341c38 |
hex | 3e9c33bd |
1050424253 has 16 divisors (see below), whose sum is σ = 1133721600. Its totient is φ = 970023600.
The previous prime is 1050424241. The next prime is 1050424261. The reversal of 1050424253 is 3524240501.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1050424253 - 218 = 1050162109 is a prime.
It is a super-2 number, since 2×10504242532 = 2206782222581216018, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050424853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537428 + ... + 539378.
It is an arithmetic number, because the mean of its divisors is an integer number (70857600).
Almost surely, 21050424253 is an apocalyptic number.
It is an amenable number.
1050424253 is a deficient number, since it is larger than the sum of its proper divisors (83297347).
1050424253 is a wasteful number, since it uses less digits than its factorization.
1050424253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2672.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 1050424253 is about 32410.2491968204. The cubic root of 1050424253 is about 1016.5332301926.
Adding to 1050424253 its reverse (3524240501), we get a palindrome (4574664754).
The spelling of 1050424253 in words is "one billion, fifty million, four hundred twenty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •