Base | Representation |
---|---|
bin | 10011010110101011… |
… | …00010101101100001 |
3 | 222211011000110222212 |
4 | 21223111202231201 |
5 | 132240012301110 |
6 | 4435021411505 |
7 | 515330603003 |
oct | 115325425541 |
9 | 28734013885 |
10 | 10390743905 |
11 | 4452338763 |
12 | 201ba09b95 |
13 | c9793a999 |
14 | 707dd8373 |
15 | 40c343e05 |
hex | 26b562b61 |
10390743905 has 8 divisors (see below), whose sum is σ = 12469545000. Its totient is φ = 8312160256.
The previous prime is 10390743899. The next prime is 10390743907. The reversal of 10390743905 is 50934709301.
10390743905 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 6426908224 + 3963835681 = 80168^2 + 62959^2 .
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 10390743905 - 212 = 10390739809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10390743907) 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, 81761 + ... + 165729.
It is an arithmetic number, because the mean of its divisors is an integer number (1558693125).
Almost surely, 210390743905 is an apocalyptic number.
It is an amenable number.
10390743905 is a deficient number, since it is larger than the sum of its proper divisors (2078801095).
10390743905 is an equidigital number, since it uses as much as digits as its factorization.
10390743905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108723.
The product of its (nonzero) digits is 102060, while the sum is 41.
The spelling of 10390743905 in words is "ten billion, three hundred ninety million, seven hundred forty-three thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •