Base | Representation |
---|---|
bin | 111111000101101… |
… | …001001101100011 |
3 | 2201202122112101111 |
4 | 333011221031203 |
5 | 4131430203011 |
6 | 253010044151 |
7 | 35141424643 |
oct | 7705511543 |
9 | 2652575344 |
10 | 1058444131 |
11 | 4a3511818 |
12 | 256579657 |
13 | 13b390c04 |
14 | a0802523 |
15 | 62dc8121 |
hex | 3f169363 |
1058444131 has 4 divisors (see below), whose sum is σ = 1058779432. Its totient is φ = 1058108832.
The previous prime is 1058444111. The next prime is 1058444201. The reversal of 1058444131 is 1314448501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1058444131 is a prime.
It is a super-2 number, since 2×10584441312 = 2240607956896690322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1058444093 and 1058444102.
It is not an unprimeable number, because it can be changed into a prime (1058444111) 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 3 ways as a sum of consecutive naturals, for example, 162870 + ... + 169243.
It is an arithmetic number, because the mean of its divisors is an integer number (264694858).
Almost surely, 21058444131 is an apocalyptic number.
1058444131 is a deficient number, since it is larger than the sum of its proper divisors (335301).
1058444131 is an equidigital number, since it uses as much as digits as its factorization.
1058444131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335300.
The product of its (nonzero) digits is 7680, while the sum is 31.
The square root of 1058444131 is about 32533.7383495964. The cubic root of 1058444131 is about 1019.1137152583.
The spelling of 1058444131 in words is "one billion, fifty-eight million, four hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •