Base | Representation |
---|---|
bin | 100000110100100… |
… | …1011100001011111 |
3 | 2211202022112222201 |
4 | 1001221023201133 |
5 | 4223414023033 |
6 | 301140552331 |
7 | 36202005256 |
oct | 10151134137 |
9 | 2752275881 |
10 | 1101314143 |
11 | 515732686 |
12 | 2689b26a7 |
13 | 147220b97 |
14 | a63a179d |
15 | 66a4547d |
hex | 41a4b85f |
1101314143 has 2 divisors, whose sum is σ = 1101314144. Its totient is φ = 1101314142.
The previous prime is 1101314141. The next prime is 1101314167. The reversal of 1101314143 is 3414131011.
It is a weak prime.
It is an emirp because it is prime and its reverse (3414131011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101314143 - 21 = 1101314141 is a prime.
Together with 1101314141, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1101314143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101314141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550657071 + 550657072.
It is an arithmetic number, because the mean of its divisors is an integer number (550657072).
Almost surely, 21101314143 is an apocalyptic number.
1101314143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101314143 is an equidigital number, since it uses as much as digits as its factorization.
1101314143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 1101314143 is about 33186.0534411671. The cubic root of 1101314143 is about 1032.6910317680.
Adding to 1101314143 its reverse (3414131011), we get a palindrome (4515445154).
The spelling of 1101314143 in words is "one billion, one hundred one million, three hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •