Base | Representation |
---|---|
bin | 111101001011100… |
… | …010110110111101 |
3 | 2122112102101020012 |
4 | 331023202312331 |
5 | 4100231432131 |
6 | 245504033005 |
7 | 34302365234 |
oct | 7513426675 |
9 | 2575371205 |
10 | 1026436541 |
11 | 48743aa69 |
12 | 247902765 |
13 | 134865200 |
14 | 9a46db1b |
15 | 601a452b |
hex | 3d2e2dbd |
1026436541 has 12 divisors (see below), whose sum is σ = 1121683860. Its totient is φ = 938770560.
The previous prime is 1026436501. The next prime is 1026436549. The reversal of 1026436541 is 1456346201.
It can be written as a sum of positive squares in 6 ways, for example, as 6911641 + 1019524900 = 2629^2 + 31930^2 .
It is a de Polignac number, because none of the positive numbers 2k-1026436541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1026436498 and 1026436507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1026436549) 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 11 ways as a sum of consecutive naturals, for example, 9440 + ... + 46281.
It is an arithmetic number, because the mean of its divisors is an integer number (93473655).
Almost surely, 21026436541 is an apocalyptic number.
It is an amenable number.
1026436541 is a deficient number, since it is larger than the sum of its proper divisors (95247319).
1026436541 is a wasteful number, since it uses less digits than its factorization.
1026436541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55856 (or 55843 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 1026436541 is about 32038.0483331928. The cubic root of 1026436541 is about 1008.7356466016.
The spelling of 1026436541 in words is "one billion, twenty-six million, four hundred thirty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •