Base | Representation |
---|---|
bin | 10010111001001010… |
… | …10101000100101111 |
3 | 222011220021011200002 |
4 | 21130211111010233 |
5 | 131233131132421 |
6 | 4354300254515 |
7 | 506233660646 |
oct | 113445250457 |
9 | 28156234602 |
10 | 10143224111 |
11 | 4335649449 |
12 | 1b70b4143b |
13 | c58586177 |
14 | 6c31a635d |
15 | 3e574eb0b |
hex | 25c95512f |
10143224111 has 8 divisors (see below), whose sum is σ = 10400439744. Its totient is φ = 9888446880.
The previous prime is 10143224093. The next prime is 10143224153. The reversal of 10143224111 is 11142234101.
10143224111 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10143224111 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 (10143226111) 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, 601175 + ... + 617816.
It is an arithmetic number, because the mean of its divisors is an integer number (1300054968).
Almost surely, 210143224111 is an apocalyptic number.
10143224111 is a deficient number, since it is larger than the sum of its proper divisors (257215633).
10143224111 is a wasteful number, since it uses less digits than its factorization.
10143224111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1219201.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10143224111 its reverse (11142234101), we get a palindrome (21285458212).
The spelling of 10143224111 in words is "ten billion, one hundred forty-three million, two hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •