Base | Representation |
---|---|
bin | 10010110101101011… |
… | …11110001000001111 |
3 | 222002212100001211002 |
4 | 21122311332020033 |
5 | 131203143012033 |
6 | 4351334450515 |
7 | 505430566115 |
oct | 113265761017 |
9 | 28085301732 |
10 | 10114032143 |
11 | 4320120056 |
12 | 1b63203a3b |
13 | c52504c07 |
14 | 6bd367ab5 |
15 | 3e2dd53e8 |
hex | 25ad7e20f |
10114032143 has 2 divisors, whose sum is σ = 10114032144. Its totient is φ = 10114032142.
The previous prime is 10114032109. The next prime is 10114032163. The reversal of 10114032143 is 34123041101.
It is an a-pointer prime, because the next prime (10114032163) can be obtained adding 10114032143 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10114032143 - 28 = 10114031887 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10114032163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5057016071 + 5057016072.
It is an arithmetic number, because the mean of its divisors is an integer number (5057016072).
Almost surely, 210114032143 is an apocalyptic number.
10114032143 is a deficient number, since it is larger than the sum of its proper divisors (1).
10114032143 is an equidigital number, since it uses as much as digits as its factorization.
10114032143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10114032143 its reverse (34123041101), we get a palindrome (44237073244).
The spelling of 10114032143 in words is "ten billion, one hundred fourteen million, thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •