Base | Representation |
---|---|
bin | 111111000100011… |
… | …101111100100010 |
3 | 2201202001212111101 |
4 | 333010131330202 |
5 | 4131340321332 |
6 | 252555305014 |
7 | 35136002101 |
oct | 7704357442 |
9 | 2652055441 |
10 | 1058135842 |
11 | 4a3321135 |
12 | 25644b16a |
13 | 13b2b37aa |
14 | a0762038 |
15 | 62d66ae7 |
hex | 3f11df22 |
1058135842 has 16 divisors (see below), whose sum is σ = 1644539832. Its totient is φ = 510209280.
The previous prime is 1058135833. The next prime is 1058135843. The reversal of 1058135842 is 2485318501.
It is a Cunningham number, because it is equal to 325292+1.
It can be written as a sum of positive squares in 4 ways, for example, as 1017546201 + 40589641 = 31899^2 + 6371^2 .
It is a super-2 number, since 2×10581358422 = 2239302920250097928, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is not an unprimeable number, because it can be changed into a prime (1058135843) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 54909 + ... + 71632.
Almost surely, 21058135842 is an apocalyptic number.
1058135842 is a deficient number, since it is larger than the sum of its proper divisors (586403990).
1058135842 is a wasteful number, since it uses less digits than its factorization.
1058135842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126693.
The product of its (nonzero) digits is 38400, while the sum is 37.
The square root of 1058135842 is about 32529.0000153709. Note that the first 4 decimals coincide. The cubic root of 1058135842 is about 1019.0147611906.
It can be divided in two parts, 1058 and 135842, that added together give a square (136900 = 3702).
The spelling of 1058135842 in words is "one billion, fifty-eight million, one hundred thirty-five thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •