Base | Representation |
---|---|
bin | 10010110100101001… |
… | …01101001100110101 |
3 | 222002020221001002210 |
4 | 21122110231030311 |
5 | 131143424441203 |
6 | 4350423524033 |
7 | 505263510114 |
oct | 113224551465 |
9 | 28066831083 |
10 | 10105312053 |
11 | 4316204571 |
12 | 1b602b9619 |
13 | c50770ab5 |
14 | 6bc137c7b |
15 | 3e2261803 |
hex | 25a52d335 |
10105312053 has 8 divisors (see below), whose sum is σ = 13488414400. Its totient is φ = 6729542208.
The previous prime is 10105312031. The next prime is 10105312081. The reversal of 10105312053 is 35021350101.
10105312053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10105312053 - 213 = 10105303861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10105312153) 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, 1829908 + ... + 1835421.
It is an arithmetic number, because the mean of its divisors is an integer number (1686051800).
Almost surely, 210105312053 is an apocalyptic number.
It is an amenable number.
10105312053 is a deficient number, since it is larger than the sum of its proper divisors (3383102347).
10105312053 is an equidigital number, since it uses as much as digits as its factorization.
10105312053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3666251.
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 10105312053 its reverse (35021350101), we get a palindrome (45126662154).
The spelling of 10105312053 in words is "ten billion, one hundred five million, three hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •