Base | Representation |
---|---|
bin | 100110010111… |
… | …000010011111 |
3 | 200220220000111 |
4 | 212113002133 |
5 | 10033241324 |
6 | 555310451 |
7 | 151321213 |
oct | 46270237 |
9 | 20826014 |
10 | 10055839 |
11 | 5749112 |
12 | 344b427 |
13 | 2111101 |
14 | 149a943 |
15 | d39794 |
hex | 99709f |
10055839 has 4 divisors (see below), whose sum is σ = 10091656. Its totient is φ = 10020024.
The previous prime is 10055827. The next prime is 10055867. The reversal of 10055839 is 93855001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 93855001 = 137 ⋅685073.
It is a cyclic number.
It is not a de Polignac number, because 10055839 - 27 = 10055711 is a prime.
It is a super-2 number, since 2×100558392 = 202239795987842, which 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 10055839.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10055819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17484 + ... + 18049.
It is an arithmetic number, because the mean of its divisors is an integer number (2522914).
Almost surely, 210055839 is an apocalyptic number.
10055839 is a deficient number, since it is larger than the sum of its proper divisors (35817).
10055839 is an equidigital number, since it uses as much as digits as its factorization.
10055839 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35816.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 10055839 is about 3171.0942906196. The cubic root of 10055839 is about 215.8437298484.
The spelling of 10055839 in words is "ten million, fifty-five thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •