Base | Representation |
---|---|
bin | 11111001100000111010… |
… | …000010101011000100011 |
3 | 21120220020222122122001202 |
4 | 133030013100111120203 |
5 | 240103444430344412 |
6 | 4320342340151415 |
7 | 310564141555256 |
oct | 37140720253043 |
9 | 7526228578052 |
10 | 2143310403107 |
11 | 756a77934865 |
12 | 2a747a39856b |
13 | 127161c0b873 |
14 | 75a45a0509d |
15 | 3ab446593c2 |
hex | 1f307415623 |
2143310403107 has 2 divisors, whose sum is σ = 2143310403108. Its totient is φ = 2143310403106.
The previous prime is 2143310403041. The next prime is 2143310403119. The reversal of 2143310403107 is 7013040133412.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2143310403107 - 212 = 2143310399011 is a prime.
It is a super-3 number, since 3×21433104031073 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2143310403107.
It is not a weakly prime, because it can be changed into another prime (2143310403127) 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, 1071655201553 + 1071655201554.
It is an arithmetic number, because the mean of its divisors is an integer number (1071655201554).
Almost surely, 22143310403107 is an apocalyptic number.
2143310403107 is a deficient number, since it is larger than the sum of its proper divisors (1).
2143310403107 is an equidigital number, since it uses as much as digits as its factorization.
2143310403107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 2143310403107 its reverse (7013040133412), we get a palindrome (9156350536519).
The spelling of 2143310403107 in words is "two trillion, one hundred forty-three billion, three hundred ten million, four hundred three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •