Base | Representation |
---|---|
bin | 10010101111000001… |
… | …11011111001001101 |
3 | 221221222020210202011 |
4 | 21113200323321031 |
5 | 131044343430232 |
6 | 4342021501221 |
7 | 504152113234 |
oct | 112740737115 |
9 | 27858223664 |
10 | 10058186317 |
11 | 42a1647283 |
12 | 1b48571811 |
13 | c43a80a4a |
14 | 6b5b8bb1b |
15 | 3dd053547 |
hex | 25783be4d |
10058186317 has 8 divisors (see below), whose sum is σ = 10124839712. Its totient is φ = 9991566000.
The previous prime is 10058186309. The next prime is 10058186329. The reversal of 10058186317 is 71368185001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10058186317 - 23 = 10058186309 is a prime.
It is a super-2 number, since 2×100581863172 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10058186317.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10058186417) 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, 1007842 + ... + 1017772.
It is an arithmetic number, because the mean of its divisors is an integer number (1265604964).
Almost surely, 210058186317 is an apocalyptic number.
It is an amenable number.
10058186317 is a deficient number, since it is larger than the sum of its proper divisors (66653395).
10058186317 is an equidigital number, since it uses as much as digits as its factorization.
10058186317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16539.
The product of its (nonzero) digits is 40320, while the sum is 40.
The spelling of 10058186317 in words is "ten billion, fifty-eight million, one hundred eighty-six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •