Base | Representation |
---|---|
bin | 111110100110010… |
… | …111000101001101 |
3 | 2201012012220002220 |
4 | 332212113011031 |
5 | 4122330242110 |
6 | 252114205553 |
7 | 35011631061 |
oct | 7646270515 |
9 | 2635186086 |
10 | 1050243405 |
11 | 499920462 |
12 | 2538838b9 |
13 | 13977c303 |
14 | 9d6a9aa1 |
15 | 62308370 |
hex | 3e99714d |
1050243405 has 32 divisors (see below), whose sum is σ = 1728639360. Its totient is φ = 544270080.
The previous prime is 1050243379. The next prime is 1050243419. The reversal of 1050243405 is 5043420501.
It is not a de Polignac number, because 1050243405 - 27 = 1050243277 is a prime.
It is a super-2 number, since 2×10502434052 = 2206022419491988050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 69031 + ... + 82859.
It is an arithmetic number, because the mean of its divisors is an integer number (54019980).
Almost surely, 21050243405 is an apocalyptic number.
1050243405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1050243405 is a deficient number, since it is larger than the sum of its proper divisors (678395955).
1050243405 is a wasteful number, since it uses less digits than its factorization.
1050243405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13981.
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 1050243405 is about 32407.4590950911. The cubic root of 1050243405 is about 1016.4748891453.
Adding to 1050243405 its reverse (5043420501), we get a palindrome (6093663906).
The spelling of 1050243405 in words is "one billion, fifty million, two hundred forty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •