Base | Representation |
---|---|
bin | 100110100011… |
… | …001111000001 |
3 | 201000102112122 |
4 | 212203033001 |
5 | 10041341133 |
6 | 1000334025 |
7 | 151616645 |
oct | 46431701 |
9 | 21012478 |
10 | 10105793 |
11 | 57826a5 |
12 | 3474315 |
13 | 212aa79 |
14 | 14b0c25 |
15 | d49498 |
hex | 9a33c1 |
10105793 has 2 divisors, whose sum is σ = 10105794. Its totient is φ = 10105792.
The previous prime is 10105789. The next prime is 10105801. The reversal of 10105793 is 39750101.
10105793 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5234944 + 4870849 = 2288^2 + 2207^2 .
It is a cyclic number.
It is not a de Polignac number, because 10105793 - 22 = 10105789 is a prime.
It is a super-3 number, since 3×101057933 (a number of 22 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10125793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5052896 + 5052897.
It is an arithmetic number, because the mean of its divisors is an integer number (5052897).
Almost surely, 210105793 is an apocalyptic number.
It is an amenable number.
10105793 is a deficient number, since it is larger than the sum of its proper divisors (1).
10105793 is an equidigital number, since it uses as much as digits as its factorization.
10105793 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945, while the sum is 26.
The square root of 10105793 is about 3178.9609937840. The cubic root of 10105793 is about 216.2005524730.
Adding to 10105793 its reverse (39750101), we get a palindrome (49855894).
The spelling of 10105793 in words is "ten million, one hundred five thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •