Base | Representation |
---|---|
bin | 100001111011111110100… |
… | …111101110111011100111 |
3 | 22020221200010120111122211 |
4 | 201323332213232323213 |
5 | 301202212342300033 |
6 | 4543212221504251 |
7 | 330330463541011 |
oct | 41737647567347 |
9 | 8227603514584 |
10 | 2332144103143 |
11 | 81a069602588 |
12 | 317b9a412087 |
13 | 13bbc6a1824a |
14 | 80c3aac71b1 |
15 | 409e76402cd |
hex | 21efe9eeee7 |
2332144103143 has 2 divisors, whose sum is σ = 2332144103144. Its totient is φ = 2332144103142.
The previous prime is 2332144103141. The next prime is 2332144103153. The reversal of 2332144103143 is 3413014412332.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2332144103143 - 21 = 2332144103141 is a prime.
It is a super-2 number, since 2×23321441031432 (a number of 26 digits) contains 22 as substring.
Together with 2332144103141, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2332144103141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1166072051571 + 1166072051572.
It is an arithmetic number, because the mean of its divisors is an integer number (1166072051572).
Almost surely, 22332144103143 is an apocalyptic number.
2332144103143 is a deficient number, since it is larger than the sum of its proper divisors (1).
2332144103143 is an equidigital number, since it uses as much as digits as its factorization.
2332144103143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 2332144103143 its reverse (3413014412332), we get a palindrome (5745158515475).
The spelling of 2332144103143 in words is "two trillion, three hundred thirty-two billion, one hundred forty-four million, one hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •