Base | Representation |
---|---|
bin | 111110100110110… |
… | …011100100111110 |
3 | 2201012102211012220 |
4 | 332212303210332 |
5 | 4122343011001 |
6 | 252120510210 |
7 | 35012625264 |
oct | 7646634476 |
9 | 2635384186 |
10 | 1050360126 |
11 | 4999a0122 |
12 | 25391b366 |
13 | 1397c048a |
14 | 9d6da434 |
15 | 6232cc36 |
hex | 3e9b393e |
1050360126 has 16 divisors (see below), whose sum is σ = 2136326400. Its totient is φ = 344185688.
The previous prime is 1050360121. The next prime is 1050360127. The reversal of 1050360126 is 6210630501.
It is a super-2 number, since 2×10503601262 = 2206512788581471752, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050360096 and 1050360105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050360121) 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 7 ways as a sum of consecutive naturals, for example, 1483206 + ... + 1483913.
It is an arithmetic number, because the mean of its divisors is an integer number (133520400).
Almost surely, 21050360126 is an apocalyptic number.
1050360126 is an abundant number, since it is smaller than the sum of its proper divisors (1085966274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050360126 is a wasteful number, since it uses less digits than its factorization.
1050360126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2967183.
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 1050360126 is about 32409.2598804724. The cubic root of 1050360126 is about 1016.5125437722.
Adding to 1050360126 its reverse (6210630501), we get a palindrome (7260990627).
The spelling of 1050360126 in words is "one billion, fifty million, three hundred sixty thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •